./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 942b28ff7c0583b7db8395d2c315e70afc8fe68ba69d39faf867ac75d7628edb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:37:36,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:37:36,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:37:36,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:37:36,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:37:36,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:37:36,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:37:36,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:37:36,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:37:36,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:37:36,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:37:36,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:37:36,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:37:36,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:37:36,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:37:36,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:37:36,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:37:36,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:37:36,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:37:36,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:37:36,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:37:36,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:37:36,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:37:36,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:37:36,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:37:36,487 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:37:36,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:37:36,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:37:36,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:37:36,488 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:37:36,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:37:36,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:37:36,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:37:36,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:37:36,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:37:36,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:37:36,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:37:36,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:37:36,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:37:36,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:37:36,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:37:36,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:37:36,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:37:36,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:37:36,492 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-clean/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-clean/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 -> 942b28ff7c0583b7db8395d2c315e70afc8fe68ba69d39faf867ac75d7628edb [2024-10-11 20:37:36,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:37:36,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:37:36,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:37:36,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:37:36,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:37:36,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c [2024-10-11 20:37:38,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:37:38,363 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:37:38,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c [2024-10-11 20:37:38,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2c6d0aedf/fb0d52a98e7449f782704feef8b20135/FLAG3e0f53bb2 [2024-10-11 20:37:38,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2c6d0aedf/fb0d52a98e7449f782704feef8b20135 [2024-10-11 20:37:38,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:37:38,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:37:38,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:37:38,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:37:38,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:37:38,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a5c5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38, skipping insertion in model container [2024-10-11 20:37:38,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:37:38,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:37:38,655 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:37:38,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:37:38,709 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:37:38,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38 WrapperNode [2024-10-11 20:37:38,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:37:38,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:37:38,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:37:38,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:37:38,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,765 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 192 [2024-10-11 20:37:38,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:37:38,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:37:38,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:37:38,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:37:38,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,804 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-10-11 20:37:38,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:37:38,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:37:38,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:37:38,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:37:38,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (1/1) ... [2024-10-11 20:37:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:37:38,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:38,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:37:38,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:37:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:37:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:37:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:37:38,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:37:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:37:38,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:37:38,961 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:37:38,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:37:40,160 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2024-10-11 20:37:40,162 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:37:40,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:37:40,204 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:37:40,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:37:40 BoogieIcfgContainer [2024-10-11 20:37:40,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:37:40,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:37:40,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:37:40,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:37:40,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:37:38" (1/3) ... [2024-10-11 20:37:40,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3719352a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:37:40, skipping insertion in model container [2024-10-11 20:37:40,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:37:38" (2/3) ... [2024-10-11 20:37:40,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3719352a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:37:40, skipping insertion in model container [2024-10-11 20:37:40,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:37:40" (3/3) ... [2024-10-11 20:37:40,212 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound2.c [2024-10-11 20:37:40,226 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:37:40,227 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-10-11 20:37:40,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:37:40,301 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;@144cff06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:37:40,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-10-11 20:37:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 147 states have (on average 1.9727891156462585) internal successors, (290), 285 states have internal predecessors, (290), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:37:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:37:40,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:40,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:37:40,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 355713825, now seen corresponding path program 1 times [2024-10-11 20:37:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:40,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530450551] [2024-10-11 20:37:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:37:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530450551] [2024-10-11 20:37:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530450551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:40,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775252501] [2024-10-11 20:37:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:37:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:40,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:37:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:37:40,486 INFO L87 Difference]: Start difference. First operand has 298 states, 147 states have (on average 1.9727891156462585) internal successors, (290), 285 states have internal predecessors, (290), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:37:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:40,549 INFO L93 Difference]: Finished difference Result 587 states and 632 transitions. [2024-10-11 20:37:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:37:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:37:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:40,560 INFO L225 Difference]: With dead ends: 587 [2024-10-11 20:37:40,560 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 20:37:40,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:37:40,570 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:40,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:37:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 20:37:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-11 20:37:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 146 states have (on average 1.8972602739726028) internal successors, (277), 276 states have internal predecessors, (277), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:37:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 297 transitions. [2024-10-11 20:37:40,629 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 297 transitions. Word has length 5 [2024-10-11 20:37:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:40,629 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 297 transitions. [2024-10-11 20:37:40,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:37:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 297 transitions. [2024-10-11 20:37:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:37:40,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:40,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:37:40,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:37:40,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:40,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 355773348, now seen corresponding path program 1 times [2024-10-11 20:37:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164056506] [2024-10-11 20:37:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:37:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164056506] [2024-10-11 20:37:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164056506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:40,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241679840] [2024-10-11 20:37:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:40,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:40,723 INFO L87 Difference]: Start difference. First operand 288 states and 297 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:37:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:40,890 INFO L93 Difference]: Finished difference Result 557 states and 576 transitions. [2024-10-11 20:37:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:37:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:40,895 INFO L225 Difference]: With dead ends: 557 [2024-10-11 20:37:40,895 INFO L226 Difference]: Without dead ends: 537 [2024-10-11 20:37:40,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 20:37:40,897 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 237 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:40,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 519 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:37:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-11 20:37:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 347. [2024-10-11 20:37:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 200 states have (on average 1.795) internal successors, (359), 330 states have internal predecessors, (359), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:37:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 389 transitions. [2024-10-11 20:37:40,925 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 389 transitions. Word has length 5 [2024-10-11 20:37:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 389 transitions. [2024-10-11 20:37:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:37:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 389 transitions. [2024-10-11 20:37:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:37:40,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:40,927 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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-10-11 20:37:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:37:40,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1772025106, now seen corresponding path program 1 times [2024-10-11 20:37:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014071886] [2024-10-11 20:37:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:37:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733834861] [2024-10-11 20:37:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:40,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:40,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:40,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:37:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:41,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:37:41,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:41,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:37:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014071886] [2024-10-11 20:37:41,234 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:37:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733834861] [2024-10-11 20:37:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733834861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425793496] [2024-10-11 20:37:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:41,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:41,239 INFO L87 Difference]: Start difference. First operand 347 states and 389 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:41,804 INFO L93 Difference]: Finished difference Result 507 states and 564 transitions. [2024-10-11 20:37:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-10-11 20:37:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:41,808 INFO L225 Difference]: With dead ends: 507 [2024-10-11 20:37:41,808 INFO L226 Difference]: Without dead ends: 452 [2024-10-11 20:37:41,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-10-11 20:37:41,810 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:41,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 266 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:37:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-11 20:37:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 432. [2024-10-11 20:37:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 280 states have (on average 1.65) internal successors, (462), 410 states have internal predecessors, (462), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:37:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 502 transitions. [2024-10-11 20:37:41,843 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 502 transitions. Word has length 38 [2024-10-11 20:37:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:41,844 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 502 transitions. [2024-10-11 20:37:41,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 502 transitions. [2024-10-11 20:37:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:37:41,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:41,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:41,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:37:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:42,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2109074736, now seen corresponding path program 1 times [2024-10-11 20:37:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778225306] [2024-10-11 20:37:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778225306] [2024-10-11 20:37:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778225306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:42,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:42,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115780171] [2024-10-11 20:37:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:42,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:42,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:42,189 INFO L87 Difference]: Start difference. First operand 432 states and 502 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:42,631 INFO L93 Difference]: Finished difference Result 465 states and 509 transitions. [2024-10-11 20:37:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-11 20:37:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:42,635 INFO L225 Difference]: With dead ends: 465 [2024-10-11 20:37:42,635 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 20:37:42,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10-11 20:37:42,639 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:42,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 424 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:37:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 20:37:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2024-10-11 20:37:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 280 states have (on average 1.5678571428571428) internal successors, (439), 410 states have internal predecessors, (439), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:37:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 479 transitions. [2024-10-11 20:37:42,662 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 479 transitions. Word has length 40 [2024-10-11 20:37:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:42,662 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 479 transitions. [2024-10-11 20:37:42,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 479 transitions. [2024-10-11 20:37:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:37:42,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:42,664 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:42,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:37:42,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash 403745458, now seen corresponding path program 1 times [2024-10-11 20:37:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476234477] [2024-10-11 20:37:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:42,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:42,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476234477] [2024-10-11 20:37:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476234477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:37:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407838081] [2024-10-11 20:37:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:37:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:42,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:37:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:37:42,800 INFO L87 Difference]: Start difference. First operand 432 states and 479 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:43,633 INFO L93 Difference]: Finished difference Result 444 states and 486 transitions. [2024-10-11 20:37:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:37:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-10-11 20:37:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:43,635 INFO L225 Difference]: With dead ends: 444 [2024-10-11 20:37:43,635 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 20:37:43,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-11 20:37:43,636 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 253 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:43,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 366 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:37:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 20:37:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2024-10-11 20:37:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 280 states have (on average 1.5607142857142857) internal successors, (437), 410 states have internal predecessors, (437), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:37:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 477 transitions. [2024-10-11 20:37:43,650 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 477 transitions. Word has length 42 [2024-10-11 20:37:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:43,650 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 477 transitions. [2024-10-11 20:37:43,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 477 transitions. [2024-10-11 20:37:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:37:43,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:43,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:43,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:37:43,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:43,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash -368792591, now seen corresponding path program 1 times [2024-10-11 20:37:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:43,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002117463] [2024-10-11 20:37:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:43,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002117463] [2024-10-11 20:37:43,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002117463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:43,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:43,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:37:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482261127] [2024-10-11 20:37:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:43,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:37:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:37:43,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:37:43,872 INFO L87 Difference]: Start difference. First operand 432 states and 477 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:45,208 INFO L93 Difference]: Finished difference Result 444 states and 484 transitions. [2024-10-11 20:37:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:37:45,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-11 20:37:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:45,212 INFO L225 Difference]: With dead ends: 444 [2024-10-11 20:37:45,212 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 20:37:45,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:37:45,213 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 252 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:45,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 368 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 20:37:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 20:37:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2024-10-11 20:37:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 280 states have (on average 1.5535714285714286) internal successors, (435), 410 states have internal predecessors, (435), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:37:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 475 transitions. [2024-10-11 20:37:45,232 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 475 transitions. Word has length 43 [2024-10-11 20:37:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:45,232 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 475 transitions. [2024-10-11 20:37:45,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 475 transitions. [2024-10-11 20:37:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:37:45,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:45,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:45,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:37:45,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -173634954, now seen corresponding path program 1 times [2024-10-11 20:37:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725204386] [2024-10-11 20:37:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:37:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288535316] [2024-10-11 20:37:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:45,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:45,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:45,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:37:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:45,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:37:45,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:45,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:37:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725204386] [2024-10-11 20:37:45,534 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:37:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288535316] [2024-10-11 20:37:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288535316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396100259] [2024-10-11 20:37:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:45,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:45,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:45,536 INFO L87 Difference]: Start difference. First operand 432 states and 475 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:46,127 INFO L93 Difference]: Finished difference Result 449 states and 482 transitions. [2024-10-11 20:37:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-10-11 20:37:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:46,130 INFO L225 Difference]: With dead ends: 449 [2024-10-11 20:37:46,130 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 20:37:46,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-10-11 20:37:46,131 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 112 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:46,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 256 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:37:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 20:37:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2024-10-11 20:37:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 283 states have (on average 1.5265017667844523) internal successors, (432), 413 states have internal predecessors, (432), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:37:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 472 transitions. [2024-10-11 20:37:46,148 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 472 transitions. Word has length 46 [2024-10-11 20:37:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:46,148 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 472 transitions. [2024-10-11 20:37:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 472 transitions. [2024-10-11 20:37:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 20:37:46,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:46,151 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:46,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:37:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:46,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1087716171, now seen corresponding path program 1 times [2024-10-11 20:37:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171449532] [2024-10-11 20:37:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171449532] [2024-10-11 20:37:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171449532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:37:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673587679] [2024-10-11 20:37:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:46,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:37:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:37:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:37:46,474 INFO L87 Difference]: Start difference. First operand 435 states and 472 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:47,470 INFO L93 Difference]: Finished difference Result 448 states and 473 transitions. [2024-10-11 20:37:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:37:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-11 20:37:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:47,475 INFO L225 Difference]: With dead ends: 448 [2024-10-11 20:37:47,476 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 20:37:47,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-11 20:37:47,476 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:47,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 383 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:37:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 20:37:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 435. [2024-10-11 20:37:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 283 states have (on average 1.5053003533568905) internal successors, (426), 413 states have internal predecessors, (426), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 20:37:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 466 transitions. [2024-10-11 20:37:47,489 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 466 transitions. Word has length 47 [2024-10-11 20:37:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:47,489 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 466 transitions. [2024-10-11 20:37:47,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 466 transitions. [2024-10-11 20:37:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 20:37:47,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:47,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:47,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:37:47,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash -296575623, now seen corresponding path program 1 times [2024-10-11 20:37:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:47,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115887689] [2024-10-11 20:37:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:37:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115887689] [2024-10-11 20:37:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115887689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:37:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141221188] [2024-10-11 20:37:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:47,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:37:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:37:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:37:47,636 INFO L87 Difference]: Start difference. First operand 435 states and 466 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:48,400 INFO L93 Difference]: Finished difference Result 446 states and 467 transitions. [2024-10-11 20:37:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:48,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-11 20:37:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:48,402 INFO L225 Difference]: With dead ends: 446 [2024-10-11 20:37:48,402 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 20:37:48,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-11 20:37:48,403 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 226 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:48,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 268 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:37:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 20:37:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2024-10-11 20:37:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 220 states have (on average 1.6227272727272728) internal successors, (357), 350 states have internal predecessors, (357), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:37:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 391 transitions. [2024-10-11 20:37:48,418 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 391 transitions. Word has length 51 [2024-10-11 20:37:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:48,419 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 391 transitions. [2024-10-11 20:37:48,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:37:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 391 transitions. [2024-10-11 20:37:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 20:37:48,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:48,423 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:37:48,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash -244803461, now seen corresponding path program 1 times [2024-10-11 20:37:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:48,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474822235] [2024-10-11 20:37:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:48,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474822235] [2024-10-11 20:37:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474822235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326324111] [2024-10-11 20:37:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:48,532 INFO L87 Difference]: Start difference. First operand 369 states and 391 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:37:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:48,980 INFO L93 Difference]: Finished difference Result 369 states and 391 transitions. [2024-10-11 20:37:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:48,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2024-10-11 20:37:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:48,982 INFO L225 Difference]: With dead ends: 369 [2024-10-11 20:37:48,982 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 20:37:48,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-10-11 20:37:48,983 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 138 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:48,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 153 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:37:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 20:37:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-10-11 20:37:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 220 states have (on average 1.5909090909090908) internal successors, (350), 343 states have internal predecessors, (350), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:37:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 384 transitions. [2024-10-11 20:37:48,993 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 384 transitions. Word has length 83 [2024-10-11 20:37:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:48,994 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 384 transitions. [2024-10-11 20:37:48,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:37:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 384 transitions. [2024-10-11 20:37:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 20:37:48,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:48,997 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:48,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:37:48,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1001027467, now seen corresponding path program 1 times [2024-10-11 20:37:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:48,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106802121] [2024-10-11 20:37:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:49,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:49,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106802121] [2024-10-11 20:37:49,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106802121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:49,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:49,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:49,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518551886] [2024-10-11 20:37:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:49,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:49,084 INFO L87 Difference]: Start difference. First operand 362 states and 384 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:37:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:49,843 INFO L93 Difference]: Finished difference Result 369 states and 387 transitions. [2024-10-11 20:37:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:49,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2024-10-11 20:37:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:49,845 INFO L225 Difference]: With dead ends: 369 [2024-10-11 20:37:49,845 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 20:37:49,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-10-11 20:37:49,846 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:49,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 391 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:37:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 20:37:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2024-10-11 20:37:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 345 states have internal predecessors, (352), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:37:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 386 transitions. [2024-10-11 20:37:49,857 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 386 transitions. Word has length 84 [2024-10-11 20:37:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:49,858 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 386 transitions. [2024-10-11 20:37:49,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:37:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 386 transitions. [2024-10-11 20:37:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 20:37:49,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:49,862 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:49,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:37:49,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 124206066, now seen corresponding path program 1 times [2024-10-11 20:37:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673640516] [2024-10-11 20:37:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:37:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:37:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673640516] [2024-10-11 20:37:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673640516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:37:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444957358] [2024-10-11 20:37:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:37:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:37:49,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:37:49,977 INFO L87 Difference]: Start difference. First operand 364 states and 386 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 20:37:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:50,275 INFO L93 Difference]: Finished difference Result 364 states and 386 transitions. [2024-10-11 20:37:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:37:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2024-10-11 20:37:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:50,277 INFO L225 Difference]: With dead ends: 364 [2024-10-11 20:37:50,277 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 20:37:50,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-10-11 20:37:50,278 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 192 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:50,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 260 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:37:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 20:37:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-10-11 20:37:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 343 states have internal predecessors, (348), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:37:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 382 transitions. [2024-10-11 20:37:50,289 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 382 transitions. Word has length 86 [2024-10-11 20:37:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:50,290 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 382 transitions. [2024-10-11 20:37:50,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 20:37:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 382 transitions. [2024-10-11 20:37:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 20:37:50,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:50,291 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:37:50,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -444579068, now seen corresponding path program 1 times [2024-10-11 20:37:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734938935] [2024-10-11 20:37:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:37:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:37:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734938935] [2024-10-11 20:37:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734938935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:37:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347723463] [2024-10-11 20:37:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:50,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:37:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:50,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:37:50,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:50,380 INFO L87 Difference]: Start difference. First operand 362 states and 382 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-11 20:37:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:50,690 INFO L93 Difference]: Finished difference Result 366 states and 382 transitions. [2024-10-11 20:37:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:37:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 87 [2024-10-11 20:37:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:50,693 INFO L225 Difference]: With dead ends: 366 [2024-10-11 20:37:50,694 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 20:37:50,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:50,694 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 19 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:50,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 912 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:37:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 20:37:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2024-10-11 20:37:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 220 states have (on average 1.5636363636363637) internal successors, (344), 341 states have internal predecessors, (344), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:37:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 378 transitions. [2024-10-11 20:37:50,708 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 378 transitions. Word has length 87 [2024-10-11 20:37:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:50,708 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 378 transitions. [2024-10-11 20:37:50,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10-11 20:37:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 378 transitions. [2024-10-11 20:37:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 20:37:50,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:50,709 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-11 20:37:50,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:37:50,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:50,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -85276979, now seen corresponding path program 1 times [2024-10-11 20:37:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:50,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112242181] [2024-10-11 20:37:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112242181] [2024-10-11 20:37:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112242181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:37:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852625944] [2024-10-11 20:37:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:50,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:50,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:37:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:50,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:37:50,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:50,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:37:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852625944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:37:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 20:37:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37337459] [2024-10-11 20:37:50,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:50,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:37:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:37:50,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:50,974 INFO L87 Difference]: Start difference. First operand 360 states and 378 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:37:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:51,117 INFO L93 Difference]: Finished difference Result 362 states and 378 transitions. [2024-10-11 20:37:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:37:51,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2024-10-11 20:37:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:51,120 INFO L225 Difference]: With dead ends: 362 [2024-10-11 20:37:51,120 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 20:37:51,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:51,121 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 420 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:51,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 364 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:37:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 20:37:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-10-11 20:37:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 333 states have internal predecessors, (336), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:37:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 370 transitions. [2024-10-11 20:37:51,134 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 370 transitions. Word has length 86 [2024-10-11 20:37:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 370 transitions. [2024-10-11 20:37:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:37:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 370 transitions. [2024-10-11 20:37:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 20:37:51,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:51,135 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-11 20:37:51,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:37:51,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:51,336 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1651380999, now seen corresponding path program 1 times [2024-10-11 20:37:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670079968] [2024-10-11 20:37:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:51,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670079968] [2024-10-11 20:37:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670079968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:37:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664777292] [2024-10-11 20:37:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:51,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:51,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:37:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:51,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:37:51,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:51,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:37:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:37:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664777292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:37:51,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:37:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 20:37:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379307476] [2024-10-11 20:37:51,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:37:51,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:37:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:37:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:37:51,672 INFO L87 Difference]: Start difference. First operand 352 states and 370 transitions. Second operand has 7 states, 6 states have (on average 29.333333333333332) internal successors, (176), 7 states have internal predecessors, (176), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 20:37:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:51,868 INFO L93 Difference]: Finished difference Result 613 states and 651 transitions. [2024-10-11 20:37:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:37:51,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 29.333333333333332) internal successors, (176), 7 states have internal predecessors, (176), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 87 [2024-10-11 20:37:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:51,871 INFO L225 Difference]: With dead ends: 613 [2024-10-11 20:37:51,871 INFO L226 Difference]: Without dead ends: 605 [2024-10-11 20:37:51,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:37:51,872 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 668 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:51,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 919 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:37:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-11 20:37:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 412. [2024-10-11 20:37:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 281 states have (on average 1.5160142348754448) internal successors, (426), 388 states have internal predecessors, (426), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 20:37:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 470 transitions. [2024-10-11 20:37:51,885 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 470 transitions. Word has length 87 [2024-10-11 20:37:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 470 transitions. [2024-10-11 20:37:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 29.333333333333332) internal successors, (176), 7 states have internal predecessors, (176), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 20:37:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 470 transitions. [2024-10-11 20:37:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 20:37:51,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:51,886 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 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] [2024-10-11 20:37:51,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:37:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:37:52,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1640076562, now seen corresponding path program 1 times [2024-10-11 20:37:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487957807] [2024-10-11 20:37:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:37:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932590022] [2024-10-11 20:37:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:52,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:52,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:52,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:37:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:52,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:37:52,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:37:52,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:37:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:37:52,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487957807] [2024-10-11 20:37:52,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:37:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932590022] [2024-10-11 20:37:52,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932590022] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:37:52,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:37:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 20:37:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656111176] [2024-10-11 20:37:52,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:37:52,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:37:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:37:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:37:52,459 INFO L87 Difference]: Start difference. First operand 412 states and 470 transitions. Second operand has 6 states, 5 states have (on average 27.4) internal successors, (137), 6 states have internal predecessors, (137), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:37:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:52,660 INFO L93 Difference]: Finished difference Result 615 states and 647 transitions. [2024-10-11 20:37:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:37:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.4) internal successors, (137), 6 states have internal predecessors, (137), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 98 [2024-10-11 20:37:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:52,664 INFO L225 Difference]: With dead ends: 615 [2024-10-11 20:37:52,664 INFO L226 Difference]: Without dead ends: 610 [2024-10-11 20:37:52,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:37:52,665 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1114 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:52,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 785 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:37:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-11 20:37:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 417. [2024-10-11 20:37:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 392 states have internal predecessors, (426), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:37:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 472 transitions. [2024-10-11 20:37:52,681 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 472 transitions. Word has length 98 [2024-10-11 20:37:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:52,681 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 472 transitions. [2024-10-11 20:37:52,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.4) internal successors, (137), 6 states have internal predecessors, (137), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:37:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 472 transitions. [2024-10-11 20:37:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 20:37:52,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:52,683 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:37:52,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:37:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:37:52,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:52,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1350073584, now seen corresponding path program 1 times [2024-10-11 20:37:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759663993] [2024-10-11 20:37:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:37:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:37:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 20:37:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759663993] [2024-10-11 20:37:53,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759663993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:53,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:53,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:37:53,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705810000] [2024-10-11 20:37:53,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:53,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:37:53,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:37:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:53,031 INFO L87 Difference]: Start difference. First operand 417 states and 472 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:37:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:53,588 INFO L93 Difference]: Finished difference Result 423 states and 475 transitions. [2024-10-11 20:37:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:37:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2024-10-11 20:37:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:53,590 INFO L225 Difference]: With dead ends: 423 [2024-10-11 20:37:53,591 INFO L226 Difference]: Without dead ends: 397 [2024-10-11 20:37:53,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:53,592 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 231 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:53,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 412 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:37:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-11 20:37:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-11 20:37:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 271 states have (on average 1.4981549815498154) internal successors, (406), 374 states have internal predecessors, (406), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 20:37:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 448 transitions. [2024-10-11 20:37:53,607 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 448 transitions. Word has length 103 [2024-10-11 20:37:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:53,609 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 448 transitions. [2024-10-11 20:37:53,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:37:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 448 transitions. [2024-10-11 20:37:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 20:37:53,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:53,610 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:37:53,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:37:53,610 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:53,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash -483346203, now seen corresponding path program 1 times [2024-10-11 20:37:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442819171] [2024-10-11 20:37:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:37:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056937928] [2024-10-11 20:37:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:53,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:53,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:37:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:53,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:37:53,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:37:53,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:37:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442819171] [2024-10-11 20:37:53,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:37:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056937928] [2024-10-11 20:37:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056937928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:37:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:37:53,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:37:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155422175] [2024-10-11 20:37:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:37:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:37:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:37:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:37:53,975 INFO L87 Difference]: Start difference. First operand 397 states and 448 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:37:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:55,091 INFO L93 Difference]: Finished difference Result 397 states and 448 transitions. [2024-10-11 20:37:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:37:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 119 [2024-10-11 20:37:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:55,093 INFO L225 Difference]: With dead ends: 397 [2024-10-11 20:37:55,093 INFO L226 Difference]: Without dead ends: 387 [2024-10-11 20:37:55,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:37:55,094 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 135 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 263 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 20:37:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-11 20:37:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-10-11 20:37:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 271 states have (on average 1.4464944649446494) internal successors, (392), 364 states have internal predecessors, (392), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 20:37:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 434 transitions. [2024-10-11 20:37:55,106 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 434 transitions. Word has length 119 [2024-10-11 20:37:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:55,106 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 434 transitions. [2024-10-11 20:37:55,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:37:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 434 transitions. [2024-10-11 20:37:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 20:37:55,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:55,107 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:37:55,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:37:55,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:37:55,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:55,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2098830314, now seen corresponding path program 1 times [2024-10-11 20:37:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374809011] [2024-10-11 20:37:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:37:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930511943] [2024-10-11 20:37:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:55,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:55,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:55,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:55,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:37:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:55,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:37:55,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:37:55,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:37:56,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374809011] [2024-10-11 20:37:56,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:37:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930511943] [2024-10-11 20:37:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930511943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:37:56,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:37:56,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:37:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720364549] [2024-10-11 20:37:56,688 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:37:56,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:37:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:37:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:37:56,692 INFO L87 Difference]: Start difference. First operand 387 states and 434 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:37:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:57,583 INFO L93 Difference]: Finished difference Result 513 states and 593 transitions. [2024-10-11 20:37:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:37:57,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 120 [2024-10-11 20:37:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:57,586 INFO L225 Difference]: With dead ends: 513 [2024-10-11 20:37:57,586 INFO L226 Difference]: Without dead ends: 490 [2024-10-11 20:37:57,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:37:57,587 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 131 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:57,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 405 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:37:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-11 20:37:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2024-10-11 20:37:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 351 states have (on average 1.4558404558404558) internal successors, (511), 444 states have internal predecessors, (511), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 20:37:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 563 transitions. [2024-10-11 20:37:57,603 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 563 transitions. Word has length 120 [2024-10-11 20:37:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:57,603 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 563 transitions. [2024-10-11 20:37:57,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:37:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 563 transitions. [2024-10-11 20:37:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 20:37:57,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:57,605 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:37:57,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:37:57,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:57,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:57,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash -639230201, now seen corresponding path program 1 times [2024-10-11 20:37:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401210675] [2024-10-11 20:37:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 20:37:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:37:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:37:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:37:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:57,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401210675] [2024-10-11 20:37:57,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401210675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:37:57,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675694969] [2024-10-11 20:37:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:57,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:57,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:57,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:57,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:37:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:58,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:37:58,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:37:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:37:58,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:37:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:37:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675694969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:37:58,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:37:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-10-11 20:37:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733089370] [2024-10-11 20:37:58,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:37:58,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:37:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:37:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:37:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:37:58,406 INFO L87 Difference]: Start difference. First operand 472 states and 563 transitions. Second operand has 8 states, 7 states have (on average 31.142857142857142) internal successors, (218), 8 states have internal predecessors, (218), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 20:37:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:37:59,354 INFO L93 Difference]: Finished difference Result 497 states and 570 transitions. [2024-10-11 20:37:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:37:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 31.142857142857142) internal successors, (218), 8 states have internal predecessors, (218), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 121 [2024-10-11 20:37:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:37:59,357 INFO L225 Difference]: With dead ends: 497 [2024-10-11 20:37:59,357 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 20:37:59,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:37:59,358 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 470 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:37:59,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 738 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:37:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 20:37:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 468. [2024-10-11 20:37:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 351 states have (on average 1.4301994301994303) internal successors, (502), 440 states have internal predecessors, (502), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 20:37:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 554 transitions. [2024-10-11 20:37:59,375 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 554 transitions. Word has length 121 [2024-10-11 20:37:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:37:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 554 transitions. [2024-10-11 20:37:59,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 31.142857142857142) internal successors, (218), 8 states have internal predecessors, (218), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 20:37:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 554 transitions. [2024-10-11 20:37:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 20:37:59,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:37:59,378 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:37:59,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:37:59,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:59,582 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:37:59,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:37:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1658700344, now seen corresponding path program 1 times [2024-10-11 20:37:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:37:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047293038] [2024-10-11 20:37:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:37:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:37:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:37:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:37:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:37:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:37:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 20:37:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:37:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:37:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:37:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:37:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047293038] [2024-10-11 20:37:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047293038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:37:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538371269] [2024-10-11 20:37:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:37:59,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:37:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:37:59,772 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:37:59,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:37:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:37:59,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:37:59,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:38:00,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:38:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538371269] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:38:00,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:38:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-10-11 20:38:00,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917215076] [2024-10-11 20:38:00,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:00,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:38:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:38:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:38:00,215 INFO L87 Difference]: Start difference. First operand 468 states and 554 transitions. Second operand has 8 states, 7 states have (on average 31.428571428571427) internal successors, (220), 8 states have internal predecessors, (220), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 20:38:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:00,831 INFO L93 Difference]: Finished difference Result 493 states and 561 transitions. [2024-10-11 20:38:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:38:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 31.428571428571427) internal successors, (220), 8 states have internal predecessors, (220), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 122 [2024-10-11 20:38:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:00,834 INFO L225 Difference]: With dead ends: 493 [2024-10-11 20:38:00,834 INFO L226 Difference]: Without dead ends: 488 [2024-10-11 20:38:00,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:38:00,835 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 334 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:00,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 449 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:38:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-11 20:38:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 464. [2024-10-11 20:38:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 351 states have (on average 1.4045584045584045) internal successors, (493), 436 states have internal predecessors, (493), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 20:38:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 545 transitions. [2024-10-11 20:38:00,851 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 545 transitions. Word has length 122 [2024-10-11 20:38:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:00,851 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 545 transitions. [2024-10-11 20:38:00,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 31.428571428571427) internal successors, (220), 8 states have internal predecessors, (220), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 20:38:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 545 transitions. [2024-10-11 20:38:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 20:38:00,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:00,853 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:00,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:38:01,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:01,053 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -119896791, now seen corresponding path program 1 times [2024-10-11 20:38:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617147533] [2024-10-11 20:38:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:01,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743276826] [2024-10-11 20:38:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:01,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:01,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:01,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:38:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:01,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:38:01,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:38:01,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:38:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617147533] [2024-10-11 20:38:01,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743276826] [2024-10-11 20:38:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743276826] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:38:01,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:38:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 20:38:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090911271] [2024-10-11 20:38:01,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:38:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:38:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:38:01,989 INFO L87 Difference]: Start difference. First operand 464 states and 545 transitions. Second operand has 10 states, 9 states have (on average 18.555555555555557) internal successors, (167), 10 states have internal predecessors, (167), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 20:38:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:06,472 INFO L93 Difference]: Finished difference Result 512 states and 552 transitions. [2024-10-11 20:38:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:38:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 18.555555555555557) internal successors, (167), 10 states have internal predecessors, (167), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 123 [2024-10-11 20:38:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:06,477 INFO L225 Difference]: With dead ends: 512 [2024-10-11 20:38:06,477 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 20:38:06,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:38:06,478 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 662 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:06,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 445 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 20:38:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 20:38:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2024-10-11 20:38:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 303 states have (on average 1.33993399339934) internal successors, (406), 386 states have internal predecessors, (406), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 452 transitions. [2024-10-11 20:38:06,496 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 452 transitions. Word has length 123 [2024-10-11 20:38:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:06,497 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 452 transitions. [2024-10-11 20:38:06,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 18.555555555555557) internal successors, (167), 10 states have internal predecessors, (167), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 20:38:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 452 transitions. [2024-10-11 20:38:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 20:38:06,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:06,500 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:38:06,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:38:06,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:38:06,701 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:06,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1525566786, now seen corresponding path program 1 times [2024-10-11 20:38:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722407114] [2024-10-11 20:38:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:38:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:38:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:38:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:38:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:38:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 20:38:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:38:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:38:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:38:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 20:38:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-10-11 20:38:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722407114] [2024-10-11 20:38:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722407114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:38:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:38:06,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:38:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112561089] [2024-10-11 20:38:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:38:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:38:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:06,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:38:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:38:06,796 INFO L87 Difference]: Start difference. First operand 411 states and 452 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:38:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:07,519 INFO L93 Difference]: Finished difference Result 411 states and 452 transitions. [2024-10-11 20:38:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:38:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 165 [2024-10-11 20:38:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:07,520 INFO L225 Difference]: With dead ends: 411 [2024-10-11 20:38:07,521 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 20:38:07,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-10-11 20:38:07,521 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 127 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:07,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 154 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:38:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 20:38:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2024-10-11 20:38:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 303 states have (on average 1.3267326732673268) internal successors, (402), 383 states have internal predecessors, (402), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 448 transitions. [2024-10-11 20:38:07,535 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 448 transitions. Word has length 165 [2024-10-11 20:38:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:07,536 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 448 transitions. [2024-10-11 20:38:07,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:38:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 448 transitions. [2024-10-11 20:38:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 20:38:07,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:07,537 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:07,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 20:38:07,538 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1015250413, now seen corresponding path program 1 times [2024-10-11 20:38:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102913296] [2024-10-11 20:38:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:07,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:38:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:38:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:38:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:38:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:38:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 20:38:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:38:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:38:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:38:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 20:38:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 20:38:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:38:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102913296] [2024-10-11 20:38:07,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102913296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842676610] [2024-10-11 20:38:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:07,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:07,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:07,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:07,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:38:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:07,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:38:07,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:38:07,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:38:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842676610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:38:08,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:38:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-11 20:38:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886819051] [2024-10-11 20:38:08,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:38:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:38:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:38:08,106 INFO L87 Difference]: Start difference. First operand 408 states and 448 transitions. Second operand has 9 states, 8 states have (on average 34.75) internal successors, (278), 9 states have internal predecessors, (278), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2024-10-11 20:38:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:08,519 INFO L93 Difference]: Finished difference Result 431 states and 457 transitions. [2024-10-11 20:38:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:38:08,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 34.75) internal successors, (278), 9 states have internal predecessors, (278), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 168 [2024-10-11 20:38:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:08,521 INFO L225 Difference]: With dead ends: 431 [2024-10-11 20:38:08,521 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 20:38:08,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:38:08,522 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 574 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:08,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 613 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:38:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 20:38:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 406. [2024-10-11 20:38:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 303 states have (on average 1.3135313531353134) internal successors, (398), 381 states have internal predecessors, (398), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 444 transitions. [2024-10-11 20:38:08,539 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 444 transitions. Word has length 168 [2024-10-11 20:38:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:08,539 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 444 transitions. [2024-10-11 20:38:08,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 34.75) internal successors, (278), 9 states have internal predecessors, (278), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2024-10-11 20:38:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 444 transitions. [2024-10-11 20:38:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 20:38:08,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:08,542 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:08,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:38:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 20:38:08,742 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1407991915, now seen corresponding path program 1 times [2024-10-11 20:38:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:08,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328894937] [2024-10-11 20:38:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:08,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142055899] [2024-10-11 20:38:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:08,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:08,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:08,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:38:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:08,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:38:08,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:38:09,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328894937] [2024-10-11 20:38:10,375 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142055899] [2024-10-11 20:38:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142055899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:10,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:38:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-11 20:38:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085454246] [2024-10-11 20:38:10,376 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:10,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:38:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:38:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:38:10,377 INFO L87 Difference]: Start difference. First operand 406 states and 444 transitions. Second operand has 7 states, 6 states have (on average 19.5) internal successors, (117), 7 states have internal predecessors, (117), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 20:38:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:11,047 INFO L93 Difference]: Finished difference Result 412 states and 444 transitions. [2024-10-11 20:38:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:38:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.5) internal successors, (117), 7 states have internal predecessors, (117), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 169 [2024-10-11 20:38:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:11,049 INFO L225 Difference]: With dead ends: 412 [2024-10-11 20:38:11,049 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 20:38:11,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:38:11,050 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 59 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:11,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 810 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:38:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 20:38:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-10-11 20:38:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 303 states have (on average 1.2937293729372936) internal successors, (392), 381 states have internal predecessors, (392), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 438 transitions. [2024-10-11 20:38:11,070 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 438 transitions. Word has length 169 [2024-10-11 20:38:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:11,070 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 438 transitions. [2024-10-11 20:38:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.5) internal successors, (117), 7 states have internal predecessors, (117), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 20:38:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 438 transitions. [2024-10-11 20:38:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 20:38:11,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:11,071 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:11,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 20:38:11,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 20:38:11,273 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:11,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 168261999, now seen corresponding path program 1 times [2024-10-11 20:38:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607128510] [2024-10-11 20:38:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849373500] [2024-10-11 20:38:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:11,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:11,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:38:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:11,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:38:11,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:38:12,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:38:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607128510] [2024-10-11 20:38:13,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849373500] [2024-10-11 20:38:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849373500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:38:13,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:38:13,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-10-11 20:38:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369712218] [2024-10-11 20:38:13,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:38:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:38:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:38:13,714 INFO L87 Difference]: Start difference. First operand 406 states and 438 transitions. Second operand has 11 states, 10 states have (on average 23.9) internal successors, (239), 11 states have internal predecessors, (239), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-11 20:38:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:20,429 INFO L93 Difference]: Finished difference Result 410 states and 438 transitions. [2024-10-11 20:38:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:38:20,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 23.9) internal successors, (239), 11 states have internal predecessors, (239), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 173 [2024-10-11 20:38:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:20,431 INFO L225 Difference]: With dead ends: 410 [2024-10-11 20:38:20,431 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 20:38:20,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:38:20,432 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 450 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:20,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 291 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-11 20:38:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 20:38:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-10-11 20:38:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 303 states have (on average 1.2805280528052805) internal successors, (388), 381 states have internal predecessors, (388), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 434 transitions. [2024-10-11 20:38:20,451 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 434 transitions. Word has length 173 [2024-10-11 20:38:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:20,451 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 434 transitions. [2024-10-11 20:38:20,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 23.9) internal successors, (239), 11 states have internal predecessors, (239), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-11 20:38:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 434 transitions. [2024-10-11 20:38:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 20:38:20,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:20,453 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:20,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 20:38:20,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:20,658 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1539470719, now seen corresponding path program 1 times [2024-10-11 20:38:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602759185] [2024-10-11 20:38:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:20,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122863464] [2024-10-11 20:38:20,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:20,705 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:20,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:38:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:20,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:38:20,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:38:21,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602759185] [2024-10-11 20:38:21,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122863464] [2024-10-11 20:38:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122863464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:21,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:38:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-11 20:38:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301116458] [2024-10-11 20:38:21,986 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:21,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:38:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:21,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:38:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:38:21,987 INFO L87 Difference]: Start difference. First operand 406 states and 434 transitions. Second operand has 8 states, 7 states have (on average 19.285714285714285) internal successors, (135), 8 states have internal predecessors, (135), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:38:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:23,434 INFO L93 Difference]: Finished difference Result 409 states and 434 transitions. [2024-10-11 20:38:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:38:23,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 19.285714285714285) internal successors, (135), 8 states have internal predecessors, (135), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 192 [2024-10-11 20:38:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:23,435 INFO L225 Difference]: With dead ends: 409 [2024-10-11 20:38:23,435 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 20:38:23,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:38:23,436 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 45 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:23,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 401 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 20:38:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 20:38:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-10-11 20:38:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 303 states have (on average 1.2706270627062706) internal successors, (385), 381 states have internal predecessors, (385), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 431 transitions. [2024-10-11 20:38:23,453 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 431 transitions. Word has length 192 [2024-10-11 20:38:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 431 transitions. [2024-10-11 20:38:23,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 19.285714285714285) internal successors, (135), 8 states have internal predecessors, (135), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:38:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 431 transitions. [2024-10-11 20:38:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 20:38:23,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:23,455 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:23,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 20:38:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 20:38:23,660 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash -478951810, now seen corresponding path program 1 times [2024-10-11 20:38:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889140462] [2024-10-11 20:38:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 20:38:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:38:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:38:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:38:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:38:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 20:38:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:38:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:38:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:38:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 20:38:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 20:38:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 20:38:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:38:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889140462] [2024-10-11 20:38:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889140462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314578879] [2024-10-11 20:38:23,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:23,969 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:23,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 20:38:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:24,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:38:24,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:38:24,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314578879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:24,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:38:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-10-11 20:38:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067739011] [2024-10-11 20:38:24,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:38:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:38:24,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:38:24,773 INFO L87 Difference]: Start difference. First operand 406 states and 431 transitions. Second operand has 11 states, 10 states have (on average 26.7) internal successors, (267), 11 states have internal predecessors, (267), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 20:38:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:27,824 INFO L93 Difference]: Finished difference Result 406 states and 431 transitions. [2024-10-11 20:38:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:38:27,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 26.7) internal successors, (267), 11 states have internal predecessors, (267), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 193 [2024-10-11 20:38:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:27,826 INFO L225 Difference]: With dead ends: 406 [2024-10-11 20:38:27,826 INFO L226 Difference]: Without dead ends: 402 [2024-10-11 20:38:27,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:38:27,827 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 565 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:27,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 223 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 20:38:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-11 20:38:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-10-11 20:38:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 303 states have (on average 1.2541254125412542) internal successors, (380), 377 states have internal predecessors, (380), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:38:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 426 transitions. [2024-10-11 20:38:27,848 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 426 transitions. Word has length 193 [2024-10-11 20:38:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:27,850 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 426 transitions. [2024-10-11 20:38:27,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 26.7) internal successors, (267), 11 states have internal predecessors, (267), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 20:38:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 426 transitions. [2024-10-11 20:38:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 20:38:27,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:27,851 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:38:27,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 20:38:28,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 20:38:28,056 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:28,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1102486096, now seen corresponding path program 1 times [2024-10-11 20:38:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:28,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769266965] [2024-10-11 20:38:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:28,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420079817] [2024-10-11 20:38:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:28,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:28,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:28,080 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:28,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 20:38:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:28,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:38:28,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:38:28,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769266965] [2024-10-11 20:38:28,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420079817] [2024-10-11 20:38:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420079817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:28,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:38:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:38:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850024877] [2024-10-11 20:38:28,351 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:38:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:38:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:38:28,352 INFO L87 Difference]: Start difference. First operand 402 states and 426 transitions. Second operand has 5 states, 4 states have (on average 34.25) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 20:38:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:28,517 INFO L93 Difference]: Finished difference Result 605 states and 636 transitions. [2024-10-11 20:38:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:38:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 34.25) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 194 [2024-10-11 20:38:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:28,520 INFO L225 Difference]: With dead ends: 605 [2024-10-11 20:38:28,520 INFO L226 Difference]: Without dead ends: 604 [2024-10-11 20:38:28,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:38:28,521 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 253 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:28,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 810 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:38:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-11 20:38:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 409. [2024-10-11 20:38:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 309 states have (on average 1.249190938511327) internal successors, (386), 383 states have internal predecessors, (386), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:38:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 434 transitions. [2024-10-11 20:38:28,540 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 434 transitions. Word has length 194 [2024-10-11 20:38:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:28,540 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 434 transitions. [2024-10-11 20:38:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 34.25) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 20:38:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 434 transitions. [2024-10-11 20:38:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 20:38:28,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:28,542 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 20:38:28,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 20:38:28,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 20:38:28,743 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:28,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -545648702, now seen corresponding path program 1 times [2024-10-11 20:38:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640261137] [2024-10-11 20:38:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992067726] [2024-10-11 20:38:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:28,775 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:28,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 20:38:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:38:28,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:38:28,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:38:29,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:41,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:41,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640261137] [2024-10-11 20:38:41,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:41,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992067726] [2024-10-11 20:38:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992067726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:38:41,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:38:41,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-11 20:38:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380719694] [2024-10-11 20:38:41,737 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:38:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:38:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=176, Unknown=2, NotChecked=0, Total=240 [2024-10-11 20:38:41,738 INFO L87 Difference]: Start difference. First operand 409 states and 434 transitions. Second operand has 9 states, 8 states have (on average 17.5) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:38:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:38:42,956 INFO L93 Difference]: Finished difference Result 411 states and 434 transitions. [2024-10-11 20:38:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:38:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.5) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 197 [2024-10-11 20:38:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:38:42,959 INFO L225 Difference]: With dead ends: 411 [2024-10-11 20:38:42,959 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 20:38:42,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=71, Invalid=199, Unknown=2, NotChecked=0, Total=272 [2024-10-11 20:38:42,960 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 91 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:38:42,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 455 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 20:38:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 20:38:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-11 20:38:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 277 states have (on average 1.2707581227436824) internal successors, (352), 351 states have internal predecessors, (352), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 20:38:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 396 transitions. [2024-10-11 20:38:42,977 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 396 transitions. Word has length 197 [2024-10-11 20:38:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:38:42,978 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 396 transitions. [2024-10-11 20:38:42,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.5) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:38:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 396 transitions. [2024-10-11 20:38:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 20:38:42,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:38:42,979 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:38:42,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-11 20:38:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:43,184 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-11 20:38:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:38:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash 748415565, now seen corresponding path program 2 times [2024-10-11 20:38:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:38:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941428880] [2024-10-11 20:38:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:38:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:38:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:38:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878643084] [2024-10-11 20:38:43,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:38:43,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:38:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:38:43,222 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:38:43,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 20:38:43,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:38:43,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:38:43,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 20:38:43,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:38:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:38:43,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:38:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:38:44,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:38:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941428880] [2024-10-11 20:38:44,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:38:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878643084] [2024-10-11 20:38:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878643084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:38:44,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:38:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2024-10-11 20:38:44,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397644108] [2024-10-11 20:38:44,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:38:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:38:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:38:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:38:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:38:44,569 INFO L87 Difference]: Start difference. First operand 375 states and 396 transitions. Second operand has 14 states, 13 states have (on average 21.0) internal successors, (273), 14 states have internal predecessors, (273), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2024-10-11 20:38:48,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:38:50,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:38:55,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:38:57,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:38:59,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:39:01,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []