./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/b.14.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash e0029e4ef6d93314dd28a1b067e9a0f7a5ca34b8281e95ccf7b3ad64c7537db6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:20:08,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:20:08,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:20:08,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:20:08,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:20:08,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:20:08,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:20:08,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:20:08,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:20:08,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:20:08,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:20:08,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:20:08,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:20:08,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:20:08,506 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:20:08,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:20:08,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:20:08,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:20:08,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:20:08,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:20:08,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:20:08,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:20:08,510 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:20:08,511 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:20:08,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:20:08,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:20:08,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:20:08,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:20:08,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:20:08,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:20:08,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:20:08,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:20:08,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:20:08,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:20:08,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:20:08,515 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0029e4ef6d93314dd28a1b067e9a0f7a5ca34b8281e95ccf7b3ad64c7537db6 [2024-10-11 20:20:08,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:20:08,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:20:08,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:20:08,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:20:08,736 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:20:08,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.14.c [2024-10-11 20:20:09,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:20:10,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:20:10,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.14.c [2024-10-11 20:20:10,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2475735d1/2d4a0a0229d046a5a7aabf6802914fc1/FLAGf39de446c [2024-10-11 20:20:10,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2475735d1/2d4a0a0229d046a5a7aabf6802914fc1 [2024-10-11 20:20:10,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:20:10,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:20:10,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:20:10,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:20:10,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:20:10,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f065ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10, skipping insertion in model container [2024-10-11 20:20:10,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:20:10,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:20:10,279 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:20:10,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:20:10,301 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:20:10,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10 WrapperNode [2024-10-11 20:20:10,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:20:10,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:20:10,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:20:10,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:20:10,309 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:20:10" (1/1) ... [2024-10-11 20:20:10,314 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:20:10" (1/1) ... [2024-10-11 20:20:10,328 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-10-11 20:20:10,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:20:10,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:20:10,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:20:10,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:20:10,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,381 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:20:10,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:20:10,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:20:10,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:20:10,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:20:10,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (1/1) ... [2024-10-11 20:20:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:20:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:10,423 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:20:10,425 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:20:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:20:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:20:10,513 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:20:10,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:20:10,573 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 20:20:10,574 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:20:10,591 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:20:10,592 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:20:10,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:20:10 BoogieIcfgContainer [2024-10-11 20:20:10,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:20:10,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:20:10,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:20:10,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:20:10,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:20:10" (1/3) ... [2024-10-11 20:20:10,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d78ec7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:20:10, skipping insertion in model container [2024-10-11 20:20:10,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:10" (2/3) ... [2024-10-11 20:20:10,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d78ec7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:20:10, skipping insertion in model container [2024-10-11 20:20:10,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:20:10" (3/3) ... [2024-10-11 20:20:10,598 INFO L112 eAbstractionObserver]: Analyzing ICFG b.14.c [2024-10-11 20:20:10,610 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:20:10,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:20:10,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:20:10,662 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;@146b9fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:20:10,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:20:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 10 states have (on average 2.0) internal successors, (20), 16 states have internal predecessors, (20), 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:20:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:20:10,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:10,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:20:10,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2245537, now seen corresponding path program 1 times [2024-10-11 20:20:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375790128] [2024-10-11 20:20:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:10,816 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:20:10,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:10,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375790128] [2024-10-11 20:20:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375790128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:20:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235657058] [2024-10-11 20:20:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:10,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:10,845 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 2.0) internal successors, (20), 16 states have internal predecessors, (20), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:20:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:10,878 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-11 20:20:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 20:20:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:10,885 INFO L225 Difference]: With dead ends: 37 [2024-10-11 20:20:10,885 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 20:20:10,887 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:20:10,890 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:10,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 20:20:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-11 20:20:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 16 states have internal predecessors, (19), 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:20:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-11 20:20:10,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 4 [2024-10-11 20:20:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:10,916 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-11 20:20:10,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:20:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-10-11 20:20:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:20:10,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:10,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:20:10,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:20:10,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:10,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash 69611701, now seen corresponding path program 1 times [2024-10-11 20:20:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718513275] [2024-10-11 20:20:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:10,946 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:20:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718513275] [2024-10-11 20:20:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718513275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:10,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798423778] [2024-10-11 20:20:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:10,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:10,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:10,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:10,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:10,949 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 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:20:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:10,964 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-10-11 20:20:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:10,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 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:20:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:10,965 INFO L225 Difference]: With dead ends: 17 [2024-10-11 20:20:10,965 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 20:20:10,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:20:10,967 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:10,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 20:20:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 20:20:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 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:20:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-11 20:20:10,973 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 5 [2024-10-11 20:20:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-11 20:20:10,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:20:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-11 20:20:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:20:10,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:10,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:20:10,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:20:10,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2137004509, now seen corresponding path program 1 times [2024-10-11 20:20:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160980786] [2024-10-11 20:20:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,020 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:20:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:11,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160980786] [2024-10-11 20:20:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160980786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:11,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:11,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:20:11,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146902839] [2024-10-11 20:20:11,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:11,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:11,023 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:11,044 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-11 20:20:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-11 20:20:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:11,045 INFO L225 Difference]: With dead ends: 30 [2024-10-11 20:20:11,045 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 20:20:11,045 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:20:11,046 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:11,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 20:20:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-11 20:20:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 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:20:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-11 20:20:11,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 6 [2024-10-11 20:20:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:11,053 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-11 20:20:11,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-11 20:20:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:20:11,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:11,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:11,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:20:11,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1822630281, now seen corresponding path program 1 times [2024-10-11 20:20:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614108050] [2024-10-11 20:20:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,085 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:20:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614108050] [2024-10-11 20:20:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614108050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537251149] [2024-10-11 20:20:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:11,088 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:20:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:11,106 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-10-11 20:20:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:11,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-11 20:20:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:11,111 INFO L225 Difference]: With dead ends: 15 [2024-10-11 20:20:11,111 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 20:20:11,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:20:11,116 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:11,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 20:20:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 20:20:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 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:20:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-11 20:20:11,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2024-10-11 20:20:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:11,121 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-11 20:20:11,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:20:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-11 20:20:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:20:11,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:11,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:11,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:20:11,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash -666963803, now seen corresponding path program 1 times [2024-10-11 20:20:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143501896] [2024-10-11 20:20:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,171 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:20:11,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:11,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143501896] [2024-10-11 20:20:11,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143501896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:11,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:11,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961609711] [2024-10-11 20:20:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:11,173 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:20:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:11,187 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-10-11 20:20:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-11 20:20:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:11,188 INFO L225 Difference]: With dead ends: 14 [2024-10-11 20:20:11,188 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 20:20:11,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:20:11,188 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:11,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 8 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 20:20:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 20:20:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:20:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-11 20:20:11,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2024-10-11 20:20:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:11,191 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-11 20:20:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:20:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-11 20:20:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:20:11,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:11,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:20:11,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 798958649, now seen corresponding path program 1 times [2024-10-11 20:20:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921673424] [2024-10-11 20:20:11,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,214 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:20:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921673424] [2024-10-11 20:20:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921673424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127773597] [2024-10-11 20:20:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:11,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:11,217 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:20:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:11,225 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-10-11 20:20:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:11,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-11 20:20:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:11,229 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:20:11,229 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 20:20:11,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:20:11,230 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:11,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 20:20:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 20:20:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 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:20:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-11 20:20:11,238 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 9 [2024-10-11 20:20:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:11,239 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-11 20:20:11,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:20:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-11 20:20:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:20:11,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:11,239 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:11,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:20:11,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:11,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -999882693, now seen corresponding path program 1 times [2024-10-11 20:20:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128125093] [2024-10-11 20:20:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128125093] [2024-10-11 20:20:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128125093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831317912] [2024-10-11 20:20:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:11,289 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:20:11,290 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:20:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:20:11,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:11,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:11,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831317912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:11,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:11,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-11 20:20:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54097424] [2024-10-11 20:20:11,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:20:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:20:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:20:11,413 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:20:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:11,441 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-10-11 20:20:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:20:11,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 11 [2024-10-11 20:20:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:11,444 INFO L225 Difference]: With dead ends: 49 [2024-10-11 20:20:11,445 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 20:20:11,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:20:11,446 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:11,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 39 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 20:20:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2024-10-11 20:20:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 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:20:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-11 20:20:11,457 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 11 [2024-10-11 20:20:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:11,458 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-11 20:20:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:20:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-11 20:20:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:20:11,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:11,458 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:20:11,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:20:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:11,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1270495199, now seen corresponding path program 1 times [2024-10-11 20:20:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313451635] [2024-10-11 20:20:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313451635] [2024-10-11 20:20:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313451635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330182129] [2024-10-11 20:20:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:11,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:11,719 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:20:11,720 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:20:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:11,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:20:11,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:11,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330182129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:11,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:11,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:20:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115455816] [2024-10-11 20:20:11,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:20:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:20:11,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:20:11,815 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:20:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:11,844 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-10-11 20:20:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:20:11,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 16 [2024-10-11 20:20:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:11,846 INFO L225 Difference]: With dead ends: 109 [2024-10-11 20:20:11,847 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 20:20:11,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:20:11,848 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:11,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 20:20:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 20:20:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.1415094339622642) internal successors, (121), 107 states have internal predecessors, (121), 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:20:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2024-10-11 20:20:11,858 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 16 [2024-10-11 20:20:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:11,858 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2024-10-11 20:20:11,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:20:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2024-10-11 20:20:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:20:11,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:11,859 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-10-11 20:20:11,872 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:20:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:12,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash -485461727, now seen corresponding path program 2 times [2024-10-11 20:20:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842584083] [2024-10-11 20:20:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:20:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842584083] [2024-10-11 20:20:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842584083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363750865] [2024-10-11 20:20:12,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:20:12,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:12,182 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:20:12,183 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:20:12,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:20:12,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:12,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:20:12,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:20:12,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:12,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363750865] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:12,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 10] total 14 [2024-10-11 20:20:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997166226] [2024-10-11 20:20:12,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:20:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:12,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:20:12,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:20:12,474 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 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:20:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:12,505 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-10-11 20:20:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:20:12,506 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 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 32 [2024-10-11 20:20:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:12,506 INFO L225 Difference]: With dead ends: 108 [2024-10-11 20:20:12,506 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 20:20:12,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:20:12,507 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:12,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 20:20:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 46. [2024-10-11 20:20:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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:20:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-10-11 20:20:12,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 32 [2024-10-11 20:20:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:12,514 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-10-11 20:20:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 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:20:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-10-11 20:20:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:20:12,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:12,515 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2024-10-11 20:20:12,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:20:12,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:12,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:12,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1779341639, now seen corresponding path program 2 times [2024-10-11 20:20:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626179793] [2024-10-11 20:20:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626179793] [2024-10-11 20:20:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626179793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387953477] [2024-10-11 20:20:12,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:20:12,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:12,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:12,776 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:20:12,777 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:20:12,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:20:12,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:12,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:20:12,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:12,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387953477] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:12,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:12,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 20:20:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821479194] [2024-10-11 20:20:12,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:12,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:20:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:20:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:20:12,937 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 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:20:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:12,988 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2024-10-11 20:20:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:20:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 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 37 [2024-10-11 20:20:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:12,989 INFO L225 Difference]: With dead ends: 101 [2024-10-11 20:20:12,989 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 20:20:12,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:20:12,990 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:12,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 78 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 20:20:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 20:20:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 99 states have internal predecessors, (110), 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:20:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-10-11 20:20:13,009 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 37 [2024-10-11 20:20:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:13,009 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-10-11 20:20:13,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 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:20:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-10-11 20:20:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 20:20:13,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:13,013 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2024-10-11 20:20:13,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:20:13,214 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,SelfDestructingSolverStorable9 [2024-10-11 20:20:13,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -895884679, now seen corresponding path program 3 times [2024-10-11 20:20:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833708552] [2024-10-11 20:20:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:13,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:13,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833708552] [2024-10-11 20:20:13,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833708552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:13,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75393947] [2024-10-11 20:20:13,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:20:13,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:13,414 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:20:13,415 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:20:13,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 20:20:13,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:13,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:20:13,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:13,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75393947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:13,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:13,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-11 20:20:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687502958] [2024-10-11 20:20:13,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:13,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:20:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:13,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:20:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:20:13,810 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 24 states, 23 states have (on average 6.869565217391305) internal successors, (158), 23 states have internal predecessors, (158), 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:20:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:13,882 INFO L93 Difference]: Finished difference Result 209 states and 242 transitions. [2024-10-11 20:20:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:20:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.869565217391305) internal successors, (158), 23 states have internal predecessors, (158), 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 79 [2024-10-11 20:20:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:13,883 INFO L225 Difference]: With dead ends: 209 [2024-10-11 20:20:13,883 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 20:20:13,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:20:13,884 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 103 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:13,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 162 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 20:20:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-10-11 20:20:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.1111111111111112) internal successors, (230), 207 states have internal predecessors, (230), 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:20:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-10-11 20:20:13,907 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 79 [2024-10-11 20:20:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:13,909 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-10-11 20:20:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.869565217391305) internal successors, (158), 23 states have internal predecessors, (158), 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:20:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-10-11 20:20:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 20:20:13,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:13,911 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 1, 1, 1] [2024-10-11 20:20:13,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:20:14,114 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,SelfDestructingSolverStorable10 [2024-10-11 20:20:14,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:14,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1457337863, now seen corresponding path program 4 times [2024-10-11 20:20:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056010748] [2024-10-11 20:20:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056010748] [2024-10-11 20:20:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056010748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368858339] [2024-10-11 20:20:14,649 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:20:14,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:14,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:14,650 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:20:14,651 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:20:14,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:20:14,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:14,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:20:14,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:14,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:15,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368858339] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:15,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:15,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2024-10-11 20:20:15,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182488884] [2024-10-11 20:20:15,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:15,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 20:20:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 20:20:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:20:15,652 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 48 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 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:20:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:15,801 INFO L93 Difference]: Finished difference Result 425 states and 494 transitions. [2024-10-11 20:20:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 20:20:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 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 163 [2024-10-11 20:20:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:15,803 INFO L225 Difference]: With dead ends: 425 [2024-10-11 20:20:15,803 INFO L226 Difference]: Without dead ends: 424 [2024-10-11 20:20:15,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:20:15,805 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 268 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:15,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 330 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-11 20:20:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2024-10-11 20:20:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 1.1111111111111112) internal successors, (470), 423 states have internal predecessors, (470), 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:20:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 470 transitions. [2024-10-11 20:20:15,829 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 470 transitions. Word has length 163 [2024-10-11 20:20:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:15,830 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 470 transitions. [2024-10-11 20:20:15,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 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:20:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 470 transitions. [2024-10-11 20:20:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-11 20:20:15,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:15,833 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 1, 1, 1] [2024-10-11 20:20:15,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:20:16,033 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,SelfDestructingSolverStorable11 [2024-10-11 20:20:16,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1876666119, now seen corresponding path program 5 times [2024-10-11 20:20:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18344219] [2024-10-11 20:20:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18344219] [2024-10-11 20:20:17,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18344219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968258382] [2024-10-11 20:20:17,856 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 20:20:17,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:17,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:17,858 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:20:17,859 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:20:17,974 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-11 20:20:17,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:17,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 20:20:17,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:18,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968258382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:20,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2024-10-11 20:20:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113559298] [2024-10-11 20:20:20,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:20,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-11 20:20:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-11 20:20:20,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:20:20,429 INFO L87 Difference]: Start difference. First operand 424 states and 470 transitions. Second operand has 96 states, 95 states have (on average 6.968421052631579) internal successors, (662), 95 states have internal predecessors, (662), 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:20:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:21,127 INFO L93 Difference]: Finished difference Result 857 states and 998 transitions. [2024-10-11 20:20:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 20:20:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.968421052631579) internal successors, (662), 95 states have internal predecessors, (662), 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 331 [2024-10-11 20:20:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:21,131 INFO L225 Difference]: With dead ends: 857 [2024-10-11 20:20:21,131 INFO L226 Difference]: Without dead ends: 856 [2024-10-11 20:20:21,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:20:21,133 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 603 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:21,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 666 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:20:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2024-10-11 20:20:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2024-10-11 20:20:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.1111111111111112) internal successors, (950), 855 states have internal predecessors, (950), 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:20:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 950 transitions. [2024-10-11 20:20:21,181 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 950 transitions. Word has length 331 [2024-10-11 20:20:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:21,181 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 950 transitions. [2024-10-11 20:20:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.968421052631579) internal successors, (662), 95 states have internal predecessors, (662), 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:20:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 950 transitions. [2024-10-11 20:20:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2024-10-11 20:20:21,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:21,193 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 94, 1, 1, 1] [2024-10-11 20:20:21,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:20:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:21,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1449555705, now seen corresponding path program 6 times [2024-10-11 20:20:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856416395] [2024-10-11 20:20:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856416395] [2024-10-11 20:20:26,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856416395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818551613] [2024-10-11 20:20:26,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 20:20:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:26,881 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:20:26,881 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:20:27,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-11 20:20:27,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:27,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 20:20:27,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:27,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818551613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:34,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2024-10-11 20:20:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247078696] [2024-10-11 20:20:34,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2024-10-11 20:20:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2024-10-11 20:20:34,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:20:34,998 INFO L87 Difference]: Start difference. First operand 856 states and 950 transitions. Second operand has 192 states, 191 states have (on average 6.984293193717278) internal successors, (1334), 191 states have internal predecessors, (1334), 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:20:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:40,998 INFO L93 Difference]: Finished difference Result 1721 states and 2006 transitions. [2024-10-11 20:20:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-10-11 20:20:40,999 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.984293193717278) internal successors, (1334), 191 states have internal predecessors, (1334), 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 667 [2024-10-11 20:20:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:41,007 INFO L225 Difference]: With dead ends: 1721 [2024-10-11 20:20:41,007 INFO L226 Difference]: Without dead ends: 1720 [2024-10-11 20:20:41,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1427 GetRequests, 1237 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:20:41,010 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1641 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:41,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1338 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:20:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-11 20:20:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1720. [2024-10-11 20:20:41,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.1111111111111112) internal successors, (1910), 1719 states have internal predecessors, (1910), 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:20:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 1910 transitions. [2024-10-11 20:20:41,071 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 1910 transitions. Word has length 667 [2024-10-11 20:20:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:41,072 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 1910 transitions. [2024-10-11 20:20:41,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.984293193717278) internal successors, (1334), 191 states have internal predecessors, (1334), 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:20:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 1910 transitions. [2024-10-11 20:20:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2024-10-11 20:20:41,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:41,100 INFO L215 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 190, 1, 1, 1] [2024-10-11 20:20:41,113 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:20:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:20:41,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:20:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -941182215, now seen corresponding path program 7 times [2024-10-11 20:20:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:41,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064690149] [2024-10-11 20:20:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:21:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:21:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:21:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064690149] [2024-10-11 20:21:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064690149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:21:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449373058] [2024-10-11 20:21:04,926 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 20:21:04,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:21:04,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:21:04,927 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:21:04,928 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:21:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:21:05,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 2492 conjuncts, 192 conjuncts are in the unsatisfiable core [2024-10-11 20:21:05,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:21:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:21:06,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:21:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:21:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449373058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:21:34,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:21:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2024-10-11 20:21:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241775363] [2024-10-11 20:21:34,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:21:34,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2024-10-11 20:21:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:21:34,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2024-10-11 20:21:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2024-10-11 20:21:34,522 INFO L87 Difference]: Start difference. First operand 1720 states and 1910 transitions. Second operand has 384 states, 383 states have (on average 6.992167101827676) internal successors, (2678), 383 states have internal predecessors, (2678), 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)