./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29123ed479a06938c1b58bc0ee2ae38219e9e012922d3ca9fba5679eb1736558 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:10:23,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:10:23,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:10:23,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:10:23,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:10:23,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:10:23,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:10:23,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:10:23,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:10:23,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:10:23,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:10:23,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:10:23,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:10:23,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:10:23,319 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:10:23,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:10:23,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:10:23,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:10:23,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:10:23,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:10:23,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:10:23,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:10:23,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:10:23,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:10:23,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:10:23,324 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:10:23,324 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:10:23,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:10:23,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:10:23,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:10:23,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:10:23,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:10:23,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:10:23,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:10:23,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:10:23,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:10:23,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:10:23,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:10:23,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:10:23,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:10:23,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:10:23,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:10:23,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:10:23,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:10:23,331 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29123ed479a06938c1b58bc0ee2ae38219e9e012922d3ca9fba5679eb1736558 [2024-11-10 19:10:23,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:10:23,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:10:23,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:10:23,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:10:23,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:10:23,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound2.c [2024-11-10 19:10:24,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:10:24,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:10:24,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound2.c [2024-11-10 19:10:24,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3597309c8/4bbb82fb73a84a738b9bd5e7bfc06d77/FLAGaf8a40696 [2024-11-10 19:10:24,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3597309c8/4bbb82fb73a84a738b9bd5e7bfc06d77 [2024-11-10 19:10:24,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:10:24,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:10:24,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:10:24,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:10:24,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:10:24,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:24" (1/1) ... [2024-11-10 19:10:24,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a013b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:24, skipping insertion in model container [2024-11-10 19:10:24,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:24" (1/1) ... [2024-11-10 19:10:24,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:10:25,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:10:25,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:10:25,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:10:25,107 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:10:25,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25 WrapperNode [2024-11-10 19:10:25,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:10:25,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:10:25,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:10:25,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:10:25,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,135 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 152 [2024-11-10 19:10:25,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:10:25,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:10:25,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:10:25,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:10:25,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,158 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:10:25,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:10:25,166 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:10:25,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:10:25,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:10:25,167 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (1/1) ... [2024-11-10 19:10:25,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:10:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:25,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:10:25,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:10:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:10:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:10:25,230 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:10:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:10:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:10:25,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:10:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:10:25,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:10:25,274 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:10:25,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:10:25,680 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-10 19:10:25,681 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:10:25,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:10:25,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:10:25,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:25 BoogieIcfgContainer [2024-11-10 19:10:25,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:10:25,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:10:25,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:10:25,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:10:25,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:10:24" (1/3) ... [2024-11-10 19:10:25,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35de11cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:25, skipping insertion in model container [2024-11-10 19:10:25,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:25" (2/3) ... [2024-11-10 19:10:25,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35de11cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:25, skipping insertion in model container [2024-11-10 19:10:25,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:25" (3/3) ... [2024-11-10 19:10:25,706 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound2.c [2024-11-10 19:10:25,718 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:10:25,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-10 19:10:25,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:10:25,765 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@130bfcf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:10:25,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-10 19:10:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 121 states have (on average 1.8512396694214877) internal successors, (224), 213 states have internal predecessors, (224), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:10:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 19:10:25,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:25,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:25,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:25,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1710105666, now seen corresponding path program 1 times [2024-11-10 19:10:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:25,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867633837] [2024-11-10 19:10:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:25,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867633837] [2024-11-10 19:10:25,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867633837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:25,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030652545] [2024-11-10 19:10:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:26,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:26,009 INFO L87 Difference]: Start difference. First operand has 224 states, 121 states have (on average 1.8512396694214877) internal successors, (224), 213 states have internal predecessors, (224), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:26,098 INFO L93 Difference]: Finished difference Result 430 states and 483 transitions. [2024-11-10 19:10:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-10 19:10:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:26,106 INFO L225 Difference]: With dead ends: 430 [2024-11-10 19:10:26,106 INFO L226 Difference]: Without dead ends: 203 [2024-11-10 19:10:26,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:26,111 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 15 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:26,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 380 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-10 19:10:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-10 19:10:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 193 states have internal predecessors, (196), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 210 transitions. [2024-11-10 19:10:26,146 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 210 transitions. Word has length 14 [2024-11-10 19:10:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 210 transitions. [2024-11-10 19:10:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 210 transitions. [2024-11-10 19:10:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:10:26,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:26,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:26,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:10:26,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:26,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1473667911, now seen corresponding path program 1 times [2024-11-10 19:10:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:26,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443920173] [2024-11-10 19:10:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443920173] [2024-11-10 19:10:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443920173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:26,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:26,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:26,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291722805] [2024-11-10 19:10:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:26,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:26,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:26,209 INFO L87 Difference]: Start difference. First operand 203 states and 210 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:26,261 INFO L93 Difference]: Finished difference Result 203 states and 210 transitions. [2024-11-10 19:10:26,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:26,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-10 19:10:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:26,263 INFO L225 Difference]: With dead ends: 203 [2024-11-10 19:10:26,263 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 19:10:26,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:26,264 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 14 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:26,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 367 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 19:10:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-10 19:10:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 116 states have (on average 1.6551724137931034) internal successors, (192), 189 states have internal predecessors, (192), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 206 transitions. [2024-11-10 19:10:26,278 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 206 transitions. Word has length 15 [2024-11-10 19:10:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:26,279 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 206 transitions. [2024-11-10 19:10:26,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 206 transitions. [2024-11-10 19:10:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 19:10:26,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:26,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:10:26,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash 209687925, now seen corresponding path program 1 times [2024-11-10 19:10:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122488780] [2024-11-10 19:10:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565809757] [2024-11-10 19:10:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:26,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:26,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:10:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:26,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:10:26,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:26,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122488780] [2024-11-10 19:10:26,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:26,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565809757] [2024-11-10 19:10:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565809757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:26,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:26,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:10:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455416190] [2024-11-10 19:10:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:26,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:10:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:10:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:26,418 INFO L87 Difference]: Start difference. First operand 199 states and 206 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:26,477 INFO L93 Difference]: Finished difference Result 199 states and 206 transitions. [2024-11-10 19:10:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-10 19:10:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:26,478 INFO L225 Difference]: With dead ends: 199 [2024-11-10 19:10:26,478 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 19:10:26,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:26,479 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:26,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 711 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 19:10:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-10 19:10:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 116 states have (on average 1.6379310344827587) internal successors, (190), 187 states have internal predecessors, (190), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 204 transitions. [2024-11-10 19:10:26,488 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 204 transitions. Word has length 19 [2024-11-10 19:10:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:26,489 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 204 transitions. [2024-11-10 19:10:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 204 transitions. [2024-11-10 19:10:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:10:26,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:26,490 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:26,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:10:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:26,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash -847435607, now seen corresponding path program 1 times [2024-11-10 19:10:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761870033] [2024-11-10 19:10:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:26,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:26,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801086348] [2024-11-10 19:10:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:26,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:10:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:26,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:10:26,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:10:26,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761870033] [2024-11-10 19:10:26,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801086348] [2024-11-10 19:10:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801086348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:26,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-10 19:10:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59478436] [2024-11-10 19:10:26,912 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:26,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:10:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:10:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:26,913 INFO L87 Difference]: Start difference. First operand 197 states and 204 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:27,010 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2024-11-10 19:10:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:27,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-10 19:10:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:27,011 INFO L225 Difference]: With dead ends: 197 [2024-11-10 19:10:27,011 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 19:10:27,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:27,012 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 152 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:27,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 500 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 19:10:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-10 19:10:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 184 states have internal predecessors, (187), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 201 transitions. [2024-11-10 19:10:27,019 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 201 transitions. Word has length 37 [2024-11-10 19:10:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:27,020 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 201 transitions. [2024-11-10 19:10:27,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2024-11-10 19:10:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 19:10:27,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:27,021 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:27,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:10:27,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 19:10:27,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash -500699885, now seen corresponding path program 1 times [2024-11-10 19:10:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805825323] [2024-11-10 19:10:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:10:27,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805825323] [2024-11-10 19:10:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805825323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257005596] [2024-11-10 19:10:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:27,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:27,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:27,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:27,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:10:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:27,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:10:27,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:10:27,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:27,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257005596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:27,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:10:27,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 19:10:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799625609] [2024-11-10 19:10:27,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:27,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:27,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:27,611 INFO L87 Difference]: Start difference. First operand 194 states and 201 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:10:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:27,751 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2024-11-10 19:10:27,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:10:27,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 38 [2024-11-10 19:10:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:27,753 INFO L225 Difference]: With dead ends: 194 [2024-11-10 19:10:27,753 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 19:10:27,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:27,754 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 176 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:27,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 622 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 19:10:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-10 19:10:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 116 states have (on average 1.603448275862069) internal successors, (186), 183 states have internal predecessors, (186), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2024-11-10 19:10:27,765 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 38 [2024-11-10 19:10:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:27,766 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2024-11-10 19:10:27,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:10:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2024-11-10 19:10:27,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 19:10:27,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:27,767 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:27,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 19:10:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:27,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:27,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2084703634, now seen corresponding path program 1 times [2024-11-10 19:10:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407629060] [2024-11-10 19:10:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:10:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407629060] [2024-11-10 19:10:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407629060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:28,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251806025] [2024-11-10 19:10:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:28,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:28,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:28,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:28,038 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:28,088 INFO L93 Difference]: Finished difference Result 201 states and 208 transitions. [2024-11-10 19:10:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:28,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-10 19:10:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:28,090 INFO L225 Difference]: With dead ends: 201 [2024-11-10 19:10:28,091 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 19:10:28,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:28,092 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 103 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:28,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 19:10:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-10 19:10:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 122 states have (on average 1.5655737704918034) internal successors, (191), 188 states have internal predecessors, (191), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 205 transitions. [2024-11-10 19:10:28,107 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 205 transitions. Word has length 42 [2024-11-10 19:10:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:28,107 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 205 transitions. [2024-11-10 19:10:28,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 205 transitions. [2024-11-10 19:10:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 19:10:28,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:28,108 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:28,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:10:28,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:28,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash -201303067, now seen corresponding path program 1 times [2024-11-10 19:10:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996416742] [2024-11-10 19:10:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:10:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:28,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996416742] [2024-11-10 19:10:28,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996416742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:28,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:28,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539083026] [2024-11-10 19:10:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:28,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:28,178 INFO L87 Difference]: Start difference. First operand 198 states and 205 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:28,271 INFO L93 Difference]: Finished difference Result 202 states and 209 transitions. [2024-11-10 19:10:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-10 19:10:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:28,272 INFO L225 Difference]: With dead ends: 202 [2024-11-10 19:10:28,272 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 19:10:28,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:28,274 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 114 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:28,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 349 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 19:10:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-10 19:10:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 124 states have (on average 1.5483870967741935) internal successors, (192), 189 states have internal predecessors, (192), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 206 transitions. [2024-11-10 19:10:28,280 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 206 transitions. Word has length 43 [2024-11-10 19:10:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:28,281 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 206 transitions. [2024-11-10 19:10:28,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 206 transitions. [2024-11-10 19:10:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 19:10:28,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:28,283 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:28,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:10:28,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:28,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1945427636, now seen corresponding path program 1 times [2024-11-10 19:10:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168324901] [2024-11-10 19:10:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:28,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109688540] [2024-11-10 19:10:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:28,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:28,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:28,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:28,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:10:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:10:28,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:10:28,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:28,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168324901] [2024-11-10 19:10:28,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109688540] [2024-11-10 19:10:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109688540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:28,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967998639] [2024-11-10 19:10:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:28,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:28,360 INFO L87 Difference]: Start difference. First operand 199 states and 206 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:28,449 INFO L93 Difference]: Finished difference Result 310 states and 330 transitions. [2024-11-10 19:10:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:28,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-10 19:10:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:28,451 INFO L225 Difference]: With dead ends: 310 [2024-11-10 19:10:28,452 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 19:10:28,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:28,453 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 101 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:28,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 19:10:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 265. [2024-11-10 19:10:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 187 states have (on average 1.588235294117647) internal successors, (297), 252 states have internal predecessors, (297), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 19:10:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2024-11-10 19:10:28,463 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 44 [2024-11-10 19:10:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:28,463 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2024-11-10 19:10:28,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2024-11-10 19:10:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 19:10:28,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:28,465 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:28,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:10:28,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:28,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:28,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash -178714429, now seen corresponding path program 1 times [2024-11-10 19:10:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:28,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547660110] [2024-11-10 19:10:28,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:10:28,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547660110] [2024-11-10 19:10:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547660110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684163519] [2024-11-10 19:10:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:28,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:28,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:28,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:10:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:28,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:28,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:10:29,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684163519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:29,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:10:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-10 19:10:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483670374] [2024-11-10 19:10:29,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:29,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 19:10:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 19:10:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-10 19:10:29,236 INFO L87 Difference]: Start difference. First operand 265 states and 317 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-10 19:10:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:29,557 INFO L93 Difference]: Finished difference Result 411 states and 442 transitions. [2024-11-10 19:10:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:29,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 45 [2024-11-10 19:10:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:29,559 INFO L225 Difference]: With dead ends: 411 [2024-11-10 19:10:29,559 INFO L226 Difference]: Without dead ends: 408 [2024-11-10 19:10:29,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-10 19:10:29,560 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 651 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:29,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1042 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:10:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-10 19:10:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 311. [2024-11-10 19:10:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 231 states have (on average 1.5887445887445888) internal successors, (367), 296 states have internal predecessors, (367), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:10:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 391 transitions. [2024-11-10 19:10:29,570 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 391 transitions. Word has length 45 [2024-11-10 19:10:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:29,570 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 391 transitions. [2024-11-10 19:10:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-10 19:10:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 391 transitions. [2024-11-10 19:10:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 19:10:29,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:29,571 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:29,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:10:29,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:29,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash 54130081, now seen corresponding path program 1 times [2024-11-10 19:10:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262732501] [2024-11-10 19:10:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670111415] [2024-11-10 19:10:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:29,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:29,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:10:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:29,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:10:29,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:10:29,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:10:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262732501] [2024-11-10 19:10:30,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670111415] [2024-11-10 19:10:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670111415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:30,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:10:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 19:10:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493832684] [2024-11-10 19:10:30,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:10:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:10:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:30,070 INFO L87 Difference]: Start difference. First operand 311 states and 391 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 19:10:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:30,566 INFO L93 Difference]: Finished difference Result 454 states and 572 transitions. [2024-11-10 19:10:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:10:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2024-11-10 19:10:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:30,568 INFO L225 Difference]: With dead ends: 454 [2024-11-10 19:10:30,569 INFO L226 Difference]: Without dead ends: 427 [2024-11-10 19:10:30,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:10:30,569 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 330 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:30,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 635 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 19:10:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-10 19:10:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 401. [2024-11-10 19:10:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 335 states have (on average 1.4059701492537313) internal successors, (471), 383 states have internal predecessors, (471), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 19:10:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 501 transitions. [2024-11-10 19:10:30,582 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 501 transitions. Word has length 47 [2024-11-10 19:10:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:30,583 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 501 transitions. [2024-11-10 19:10:30,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 19:10:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 501 transitions. [2024-11-10 19:10:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 19:10:30,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:30,583 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:30,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:10:30,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:30,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:30,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash 479404671, now seen corresponding path program 1 times [2024-11-10 19:10:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361373240] [2024-11-10 19:10:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195096527] [2024-11-10 19:10:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:30,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:30,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:30,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:30,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:10:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:30,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:10:30,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:10:30,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361373240] [2024-11-10 19:10:30,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195096527] [2024-11-10 19:10:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195096527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059476477] [2024-11-10 19:10:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:30,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:30,852 INFO L87 Difference]: Start difference. First operand 401 states and 501 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:31,009 INFO L93 Difference]: Finished difference Result 617 states and 770 transitions. [2024-11-10 19:10:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:31,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-11-10 19:10:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:31,011 INFO L225 Difference]: With dead ends: 617 [2024-11-10 19:10:31,011 INFO L226 Difference]: Without dead ends: 576 [2024-11-10 19:10:31,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:31,012 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 94 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:31,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 223 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-10 19:10:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 562. [2024-11-10 19:10:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 491 states have (on average 1.319755600814664) internal successors, (648), 539 states have internal predecessors, (648), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 19:10:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 688 transitions. [2024-11-10 19:10:31,031 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 688 transitions. Word has length 49 [2024-11-10 19:10:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:31,032 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 688 transitions. [2024-11-10 19:10:31,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 688 transitions. [2024-11-10 19:10:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 19:10:31,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:31,033 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:31,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:10:31,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:31,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:31,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash -58797162, now seen corresponding path program 1 times [2024-11-10 19:10:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442226757] [2024-11-10 19:10:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:10:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 19:10:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442226757] [2024-11-10 19:10:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442226757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637934026] [2024-11-10 19:10:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:31,321 INFO L87 Difference]: Start difference. First operand 562 states and 688 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:10:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:31,489 INFO L93 Difference]: Finished difference Result 577 states and 691 transitions. [2024-11-10 19:10:31,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:31,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2024-11-10 19:10:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:31,492 INFO L225 Difference]: With dead ends: 577 [2024-11-10 19:10:31,492 INFO L226 Difference]: Without dead ends: 576 [2024-11-10 19:10:31,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:31,493 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 63 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:31,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 256 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-10 19:10:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 562. [2024-11-10 19:10:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 491 states have (on average 1.3156822810590632) internal successors, (646), 539 states have internal predecessors, (646), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 19:10:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 686 transitions. [2024-11-10 19:10:31,507 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 686 transitions. Word has length 92 [2024-11-10 19:10:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 686 transitions. [2024-11-10 19:10:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:10:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 686 transitions. [2024-11-10 19:10:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 19:10:31,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:31,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:31,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 19:10:31,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1822711957, now seen corresponding path program 1 times [2024-11-10 19:10:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702460306] [2024-11-10 19:10:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:10:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 19:10:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:31,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702460306] [2024-11-10 19:10:31,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702460306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:31,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:10:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137997294] [2024-11-10 19:10:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:31,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:10:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:31,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:10:31,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:31,621 INFO L87 Difference]: Start difference. First operand 562 states and 686 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:10:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:31,939 INFO L93 Difference]: Finished difference Result 575 states and 695 transitions. [2024-11-10 19:10:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:31,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 93 [2024-11-10 19:10:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:31,942 INFO L225 Difference]: With dead ends: 575 [2024-11-10 19:10:31,942 INFO L226 Difference]: Without dead ends: 574 [2024-11-10 19:10:31,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:31,943 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 271 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:31,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 247 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:10:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-10 19:10:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 562. [2024-11-10 19:10:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 491 states have (on average 1.3116089613034623) internal successors, (644), 539 states have internal predecessors, (644), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 19:10:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 684 transitions. [2024-11-10 19:10:31,961 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 684 transitions. Word has length 93 [2024-11-10 19:10:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:31,962 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 684 transitions. [2024-11-10 19:10:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:10:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 684 transitions. [2024-11-10 19:10:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 19:10:31,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:31,963 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:31,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 19:10:31,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:31,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash -318339165, now seen corresponding path program 1 times [2024-11-10 19:10:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997543345] [2024-11-10 19:10:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:10:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 19:10:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997543345] [2024-11-10 19:10:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997543345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273237508] [2024-11-10 19:10:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:32,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:32,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 19:10:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:32,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:32,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:32,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273237508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:32,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 19:10:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454006229] [2024-11-10 19:10:32,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:32,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:32,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:32,435 INFO L87 Difference]: Start difference. First operand 562 states and 684 transitions. Second operand has 14 states, 13 states have (on average 15.538461538461538) internal successors, (202), 14 states have internal predecessors, (202), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-10 19:10:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:33,171 INFO L93 Difference]: Finished difference Result 1219 states and 1485 transitions. [2024-11-10 19:10:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:10:33,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.538461538461538) internal successors, (202), 14 states have internal predecessors, (202), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 100 [2024-11-10 19:10:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:33,174 INFO L225 Difference]: With dead ends: 1219 [2024-11-10 19:10:33,174 INFO L226 Difference]: Without dead ends: 684 [2024-11-10 19:10:33,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-11-10 19:10:33,176 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 862 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:33,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 447 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 19:10:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-10 19:10:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 644. [2024-11-10 19:10:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 571 states have (on average 1.2942206654991244) internal successors, (739), 617 states have internal predecessors, (739), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 19:10:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 787 transitions. [2024-11-10 19:10:33,193 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 787 transitions. Word has length 100 [2024-11-10 19:10:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:33,193 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 787 transitions. [2024-11-10 19:10:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.538461538461538) internal successors, (202), 14 states have internal predecessors, (202), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-10 19:10:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 787 transitions. [2024-11-10 19:10:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 19:10:33,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:33,194 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:33,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 19:10:33,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 19:10:33,395 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-10 19:10:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1278579419, now seen corresponding path program 1 times [2024-11-10 19:10:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35446110] [2024-11-10 19:10:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:10:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:10:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:10:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:10:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 19:10:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35446110] [2024-11-10 19:10:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35446110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93159227] [2024-11-10 19:10:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:33,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:33,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 19:10:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:33,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:33,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:48,534 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_48| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_48| |v_ULTIMATE.start_main_~R~0#1_48|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2024-11-10 19:10:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 4 not checked. [2024-11-10 19:10:48,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93159227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:48,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:48,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-10 19:10:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972689348] [2024-11-10 19:10:48,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-11-10 19:10:48,699 INFO L87 Difference]: Start difference. First operand 644 states and 787 transitions. Second operand has 14 states, 13 states have (on average 14.846153846153847) internal successors, (193), 14 states have internal predecessors, (193), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 19:10:58,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:07,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:11,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:16,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:18,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:21,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:26,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:30,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:32,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:36,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:40,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:41,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:42,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:43,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:48,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:51,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:55,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:59,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:12:03,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]