./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:58:56,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:58:56,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:58:56,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:58:56,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:58:56,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:58:56,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:58:56,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:58:56,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:58:56,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:58:56,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:58:56,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:58:56,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:58:56,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:58:56,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:58:56,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:58:56,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:58:56,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:58:56,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:58:56,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:58:56,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:58:56,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:58:56,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:58:56,432 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:58:56,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:58:56,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:58:56,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:58:56,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:58:56,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:58:56,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:58:56,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:58:56,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:58:56,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:58:56,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:58:56,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:58:56,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:58:56,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:58:56,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:58:56,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:58:56,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:58:56,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:58:56,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb [2024-10-13 15:58:56,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:58:56,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:58:56,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:58:56,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:58:56,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:58:56,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2024-10-13 15:58:57,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:58:58,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:58:58,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2024-10-13 15:58:58,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752e61ab8/9f3e7111b00b42439973852672e69f70/FLAGd3ae15cd0 [2024-10-13 15:58:58,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752e61ab8/9f3e7111b00b42439973852672e69f70 [2024-10-13 15:58:58,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:58:58,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:58:58,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:58:58,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:58:58,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:58:58,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:58:58" (1/1) ... [2024-10-13 15:58:58,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43920943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:58, skipping insertion in model container [2024-10-13 15:58:58,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:58:58" (1/1) ... [2024-10-13 15:58:58,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:58:59,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:58:59,217 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:58:59,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:58:59,381 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:58:59,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59 WrapperNode [2024-10-13 15:58:59,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:58:59,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:58:59,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:58:59,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:58:59,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,452 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 189 [2024-10-13 15:58:59,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:58:59,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:58:59,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:58:59,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:58:59,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,488 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:58:59,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:58:59,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:58:59,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:58:59,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:58:59,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (1/1) ... [2024-10-13 15:58:59,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:58:59,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:58:59,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:58:59,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:58:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:58:59,598 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:58:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:58:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:58:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:58:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:58:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:58:59,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:58:59,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:58:59,942 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-13 15:58:59,942 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:58:59,976 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:58:59,979 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:58:59,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:58:59 BoogieIcfgContainer [2024-10-13 15:58:59,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:58:59,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:58:59,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:58:59,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:58:59,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:58:58" (1/3) ... [2024-10-13 15:58:59,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cc62db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:58:59, skipping insertion in model container [2024-10-13 15:58:59,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:58:59" (2/3) ... [2024-10-13 15:58:59,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cc62db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:58:59, skipping insertion in model container [2024-10-13 15:58:59,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:58:59" (3/3) ... [2024-10-13 15:58:59,988 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_15_good.i [2024-10-13 15:59:00,002 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:59:00,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 15:59:00,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:59:00,065 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;@47040c02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:59:00,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 15:59:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.607843137254902) internal successors, (82), 67 states have internal predecessors, (82), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 15:59:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 15:59:00,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash 454689643, now seen corresponding path program 1 times [2024-10-13 15:59:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737561447] [2024-10-13 15:59:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,389 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-13 15:59:00,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737561447] [2024-10-13 15:59:00,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737561447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729726863] [2024-10-13 15:59:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,419 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.607843137254902) internal successors, (82), 67 states have internal predecessors, (82), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,481 INFO L93 Difference]: Finished difference Result 149 states and 216 transitions. [2024-10-13 15:59:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 15:59:00,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,490 INFO L225 Difference]: With dead ends: 149 [2024-10-13 15:59:00,491 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 15:59:00,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 15:59:00,496 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:00,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 203 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 15:59:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-10-13 15:59:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 66 states have internal predecessors, (81), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 15:59:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2024-10-13 15:59:00,527 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 14 [2024-10-13 15:59:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:00,528 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2024-10-13 15:59:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2024-10-13 15:59:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 15:59:00,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:59:00,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1548514656, now seen corresponding path program 1 times [2024-10-13 15:59:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718407847] [2024-10-13 15:59:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,574 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-13 15:59:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718407847] [2024-10-13 15:59:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718407847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968877602] [2024-10-13 15:59:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,577 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,596 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2024-10-13 15:59:00,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-13 15:59:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,597 INFO L225 Difference]: With dead ends: 128 [2024-10-13 15:59:00,597 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 15:59:00,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 15:59:00,599 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:00,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 15:59:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 15:59:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 54 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 15:59:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-10-13 15:59:00,607 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 15 [2024-10-13 15:59:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:00,608 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-10-13 15:59:00,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-10-13 15:59:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 15:59:00,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:59:00,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1530801732, now seen corresponding path program 1 times [2024-10-13 15:59:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035069783] [2024-10-13 15:59:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,642 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-13 15:59:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035069783] [2024-10-13 15:59:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035069783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732781067] [2024-10-13 15:59:00,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,644 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,663 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2024-10-13 15:59:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-13 15:59:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,665 INFO L225 Difference]: With dead ends: 112 [2024-10-13 15:59:00,665 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 15:59:00,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 15:59:00,666 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 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-13 15:59:00,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 15:59:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 15:59:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 54 states have internal predecessors, (63), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 15:59:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2024-10-13 15:59:00,672 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 18 [2024-10-13 15:59:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:00,672 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2024-10-13 15:59:00,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-10-13 15:59:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 15:59:00,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,673 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:59:00,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1857187094, now seen corresponding path program 1 times [2024-10-13 15:59:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260763086] [2024-10-13 15:59:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:59:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:59:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260763086] [2024-10-13 15:59:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260763086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248068764] [2024-10-13 15:59:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,711 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 15:59:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,729 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2024-10-13 15:59:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-13 15:59:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,730 INFO L225 Difference]: With dead ends: 112 [2024-10-13 15:59:00,730 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 15:59:00,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 15:59:00,732 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:00,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 15:59:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 15:59:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.441860465116279) internal successors, (62), 53 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 15:59:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2024-10-13 15:59:00,737 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2024-10-13 15:59:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:00,738 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2024-10-13 15:59:00,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 15:59:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2024-10-13 15:59:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 15:59:00,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,739 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:59:00,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1825324052, now seen corresponding path program 1 times [2024-10-13 15:59:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146766254] [2024-10-13 15:59:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:59:00,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146766254] [2024-10-13 15:59:00,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146766254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193833832] [2024-10-13 15:59:00,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,788 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,827 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2024-10-13 15:59:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-13 15:59:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,829 INFO L225 Difference]: With dead ends: 106 [2024-10-13 15:59:00,829 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 15:59:00,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 15:59:00,830 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 144 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-13 15:59:00,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 144 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 15:59:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-10-13 15:59:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.425531914893617) internal successors, (67), 57 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 15:59:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2024-10-13 15:59:00,835 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 26 [2024-10-13 15:59:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:00,835 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2024-10-13 15:59:00,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-10-13 15:59:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 15:59:00,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 15:59:00,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1829610237, now seen corresponding path program 1 times [2024-10-13 15:59:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805882952] [2024-10-13 15:59:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:59:00,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805882952] [2024-10-13 15:59:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805882952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860877584] [2024-10-13 15:59:00,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,891 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,908 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2024-10-13 15:59:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-13 15:59:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,910 INFO L225 Difference]: With dead ends: 101 [2024-10-13 15:59:00,910 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 15:59:00,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 15:59:00,911 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:00,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 15:59:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 15:59:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 15:59:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-10-13 15:59:00,916 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 27 [2024-10-13 15:59:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:00,916 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-10-13 15:59:00,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-10-13 15:59:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 15:59:00,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:00,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:00,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 15:59:00,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:00,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1426902875, now seen corresponding path program 1 times [2024-10-13 15:59:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:00,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186510665] [2024-10-13 15:59:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:59:00,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186510665] [2024-10-13 15:59:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186510665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:00,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:00,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445456723] [2024-10-13 15:59:00,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:00,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:00,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:00,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:00,978 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:00,996 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2024-10-13 15:59:00,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:00,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-13 15:59:00,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:00,997 INFO L225 Difference]: With dead ends: 85 [2024-10-13 15:59:00,997 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 15:59:00,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 15:59:00,998 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:00,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 15:59:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 15:59:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 44 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 15:59:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-10-13 15:59:01,005 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 31 [2024-10-13 15:59:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,009 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-13 15:59:01,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2024-10-13 15:59:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 15:59:01,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 15:59:01,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1777818639, now seen corresponding path program 1 times [2024-10-13 15:59:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315774507] [2024-10-13 15:59:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315774507] [2024-10-13 15:59:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315774507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:59:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017852503] [2024-10-13 15:59:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,096 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,123 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-10-13 15:59:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-10-13 15:59:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,128 INFO L225 Difference]: With dead ends: 52 [2024-10-13 15:59:01,128 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 15:59:01,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,130 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:01,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 15:59:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-13 15:59:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.263157894736842) internal successors, (48), 43 states have internal predecessors, (48), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 15:59:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-10-13 15:59:01,138 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 38 [2024-10-13 15:59:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-10-13 15:59:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-10-13 15:59:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 15:59:01,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 15:59:01,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash -722196876, now seen corresponding path program 1 times [2024-10-13 15:59:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111910890] [2024-10-13 15:59:01,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111910890] [2024-10-13 15:59:01,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111910890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:59:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918186401] [2024-10-13 15:59:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,201 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,229 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-10-13 15:59:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-13 15:59:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,230 INFO L225 Difference]: With dead ends: 74 [2024-10-13 15:59:01,231 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 15:59:01,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,231 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:01,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 15:59:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-10-13 15:59:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.255813953488372) internal successors, (54), 48 states have internal predecessors, (54), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 15:59:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-10-13 15:59:01,239 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 39 [2024-10-13 15:59:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,242 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-10-13 15:59:01,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-10-13 15:59:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 15:59:01,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,243 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 15:59:01,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -664938574, now seen corresponding path program 1 times [2024-10-13 15:59:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218170338] [2024-10-13 15:59:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218170338] [2024-10-13 15:59:01,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218170338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474350156] [2024-10-13 15:59:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,287 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,302 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2024-10-13 15:59:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-13 15:59:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,304 INFO L225 Difference]: With dead ends: 82 [2024-10-13 15:59:01,304 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 15:59:01,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 15:59:01,305 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:01,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 15:59:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 15:59:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 47 states have internal predecessors, (53), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 15:59:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2024-10-13 15:59:01,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 39 [2024-10-13 15:59:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,312 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2024-10-13 15:59:01,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-10-13 15:59:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 15:59:01,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,315 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 15:59:01,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1621925019, now seen corresponding path program 1 times [2024-10-13 15:59:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755030277] [2024-10-13 15:59:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 15:59:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 15:59:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755030277] [2024-10-13 15:59:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755030277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675955049] [2024-10-13 15:59:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,360 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 15:59:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,370 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2024-10-13 15:59:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-13 15:59:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,371 INFO L225 Difference]: With dead ends: 76 [2024-10-13 15:59:01,371 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 15:59:01,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,372 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:01,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 15:59:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 15:59:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 15:59:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-10-13 15:59:01,380 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 43 [2024-10-13 15:59:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,380 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-13 15:59:01,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 15:59:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-10-13 15:59:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 15:59:01,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,381 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 15:59:01,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1029356264, now seen corresponding path program 1 times [2024-10-13 15:59:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012202008] [2024-10-13 15:59:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012202008] [2024-10-13 15:59:01,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012202008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679549055] [2024-10-13 15:59:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,418 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,428 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-10-13 15:59:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-13 15:59:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,429 INFO L225 Difference]: With dead ends: 63 [2024-10-13 15:59:01,430 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 15:59:01,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 15:59:01,431 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:01,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 15:59:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 15:59:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 15:59:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-10-13 15:59:01,436 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 43 [2024-10-13 15:59:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,436 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-10-13 15:59:01,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:59:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-10-13 15:59:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 15:59:01,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 15:59:01,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash -875656097, now seen corresponding path program 1 times [2024-10-13 15:59:01,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161201368] [2024-10-13 15:59:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 15:59:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161201368] [2024-10-13 15:59:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161201368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:59:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130717413] [2024-10-13 15:59:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,491 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,506 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-13 15:59:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-10-13 15:59:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,507 INFO L225 Difference]: With dead ends: 46 [2024-10-13 15:59:01,508 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 15:59:01,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-13 15:59:01,508 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 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-13 15:59:01,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 15:59:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 15:59:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 15:59:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-10-13 15:59:01,516 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 49 [2024-10-13 15:59:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,516 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-10-13 15:59:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-10-13 15:59:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 15:59:01,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 15:59:01,517 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1375535028, now seen corresponding path program 1 times [2024-10-13 15:59:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036132911] [2024-10-13 15:59:01,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 15:59:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036132911] [2024-10-13 15:59:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036132911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:59:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369767193] [2024-10-13 15:59:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,564 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,578 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-13 15:59:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2024-10-13 15:59:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,579 INFO L225 Difference]: With dead ends: 51 [2024-10-13 15:59:01,579 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 15:59:01,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-13 15:59:01,580 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 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-13 15:59:01,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 15:59:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 15:59:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 15:59:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-10-13 15:59:01,586 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 50 [2024-10-13 15:59:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,587 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-10-13 15:59:01,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-10-13 15:59:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 15:59:01,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:01,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 15:59:01,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2022974435, now seen corresponding path program 1 times [2024-10-13 15:59:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306979303] [2024-10-13 15:59:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 15:59:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 15:59:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 15:59:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:59:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306979303] [2024-10-13 15:59:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306979303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:01,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102083575] [2024-10-13 15:59:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:01,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,624 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:01,631 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-10-13 15:59:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:01,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-10-13 15:59:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:01,633 INFO L225 Difference]: With dead ends: 49 [2024-10-13 15:59:01,633 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:59:01,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:01,634 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:01,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:59:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:59:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-13 15:59:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:59:01,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2024-10-13 15:59:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:59:01,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:59:01,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:59:01,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 15:59:01,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 15:59:01,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 15:59:01,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:01,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:59:01,678 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:59:01,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:59:01 BoogieIcfgContainer [2024-10-13 15:59:01,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:59:01,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:59:01,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:59:01,698 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:59:01,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:58:59" (3/4) ... [2024-10-13 15:59:01,700 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:59:01,703 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:59:01,703 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:59:01,709 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 15:59:01,709 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-13 15:59:01,709 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 15:59:01,710 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:59:01,710 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:59:01,802 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 15:59:01,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 15:59:01,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:59:01,804 INFO L158 Benchmark]: Toolchain (without parser) took 3383.46ms. Allocated memory was 134.2MB in the beginning and 257.9MB in the end (delta: 123.7MB). Free memory was 59.7MB in the beginning and 176.0MB in the end (delta: -116.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,805 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:59:01,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 960.35ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 59.6MB in the beginning and 102.8MB in the end (delta: -43.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.06ms. Allocated memory is still 190.8MB. Free memory was 102.8MB in the beginning and 99.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,805 INFO L158 Benchmark]: Boogie Preprocessor took 60.68ms. Allocated memory is still 190.8MB. Free memory was 99.8MB in the beginning and 97.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,805 INFO L158 Benchmark]: RCFGBuilder took 464.44ms. Allocated memory is still 190.8MB. Free memory was 97.6MB in the beginning and 141.4MB in the end (delta: -43.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,806 INFO L158 Benchmark]: TraceAbstraction took 1716.24ms. Allocated memory was 190.8MB in the beginning and 257.9MB in the end (delta: 67.1MB). Free memory was 140.3MB in the beginning and 182.3MB in the end (delta: -42.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,806 INFO L158 Benchmark]: Witness Printer took 106.20ms. Allocated memory is still 257.9MB. Free memory was 182.3MB in the beginning and 176.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 15:59:01,807 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 960.35ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 59.6MB in the beginning and 102.8MB in the end (delta: -43.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.06ms. Allocated memory is still 190.8MB. Free memory was 102.8MB in the beginning and 99.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.68ms. Allocated memory is still 190.8MB. Free memory was 99.8MB in the beginning and 97.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.44ms. Allocated memory is still 190.8MB. Free memory was 97.6MB in the beginning and 141.4MB in the end (delta: -43.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1716.24ms. Allocated memory was 190.8MB in the beginning and 257.9MB in the end (delta: 67.1MB). Free memory was 140.3MB in the beginning and 182.3MB in the end (delta: -42.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 106.20ms. Allocated memory is still 257.9MB. Free memory was 182.3MB in the beginning and 176.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 1766 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 854 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 912 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 15:59:01,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE