./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 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/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c -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 abd4a3c7dd9fc6dd788312e2749fb84e8465aaabcc51ba8052404af690a1a44e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:39:16,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:39:16,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 19:39:16,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:39:16,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:39:16,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:39:16,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:39:16,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:39:16,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:39:16,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:39:16,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:39:16,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:39:16,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:39:16,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:39:16,507 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:39:16,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:39:16,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:39:16,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:39:16,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:39:16,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:39:16,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:39:16,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:39:16,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:39:16,512 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:39:16,512 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:39:16,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:39:16,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:39:16,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:39:16,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:39:16,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:39:16,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:39:16,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:39:16,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:39:16,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:39:16,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:39:16,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:39:16,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:39:16,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:39:16,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:39:16,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:39:16,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:39:16,527 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 -> abd4a3c7dd9fc6dd788312e2749fb84e8465aaabcc51ba8052404af690a1a44e [2024-10-24 19:39:16,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:39:16,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:39:16,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:39:16,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:39:16,777 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:39:16,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2024-10-24 19:39:18,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:39:18,410 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:39:18,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2024-10-24 19:39:18,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a25a186/852151ea5632401293162c3f5782bc98/FLAG5c1804ac8 [2024-10-24 19:39:18,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a25a186/852151ea5632401293162c3f5782bc98 [2024-10-24 19:39:18,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:39:18,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:39:18,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:39:18,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:39:18,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:39:18,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:39:18" (1/1) ... [2024-10-24 19:39:18,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57399870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:18, skipping insertion in model container [2024-10-24 19:39:18,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:39:18" (1/1) ... [2024-10-24 19:39:18,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:39:19,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:39:19,035 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:39:19,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:39:19,060 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:39:19,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19 WrapperNode [2024-10-24 19:39:19,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:39:19,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:39:19,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:39:19,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:39:19,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,091 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-10-24 19:39:19,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:39:19,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:39:19,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:39:19,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:39:19,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,104 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 19:39:19,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:39:19,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:39:19,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:39:19,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:39:19,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (1/1) ... [2024-10-24 19:39:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:39:19,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:39:19,145 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-24 19:39:19,154 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-24 19:39:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:39:19,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:39:19,266 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:39:19,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:39:19,412 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 19:39:19,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:39:19,441 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:39:19,441 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:39:19,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:39:19 BoogieIcfgContainer [2024-10-24 19:39:19,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:39:19,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:39:19,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:39:19,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:39:19,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:39:18" (1/3) ... [2024-10-24 19:39:19,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c64aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:39:19, skipping insertion in model container [2024-10-24 19:39:19,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:39:19" (2/3) ... [2024-10-24 19:39:19,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c64aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:39:19, skipping insertion in model container [2024-10-24 19:39:19,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:39:19" (3/3) ... [2024-10-24 19:39:19,449 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2024-10-24 19:39:19,462 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:39:19,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-24 19:39:19,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:39:19,519 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;@76ef71bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:39:19,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-24 19:39:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.9375) internal successors, (31), 26 states have internal predecessors, (31), 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-24 19:39:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 19:39:19,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:39:19,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 19:39:19,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-24 19:39:19,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:39:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash 86843, now seen corresponding path program 1 times [2024-10-24 19:39:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:39:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079383737] [2024-10-24 19:39:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:39:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:39:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:39:19,656 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-24 19:39:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:39:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079383737] [2024-10-24 19:39:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079383737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:39:19,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:39:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:39:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685276645] [2024-10-24 19:39:19,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:39:19,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:39:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:39:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:39:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:39:19,684 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.9375) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-24 19:39:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:39:19,737 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-24 19:39:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:39:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 19:39:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:39:19,746 INFO L225 Difference]: With dead ends: 52 [2024-10-24 19:39:19,746 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 19:39:19,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:39:19,753 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:39:19,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:39:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 19:39:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 19:39:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 23 states have internal predecessors, (26), 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-24 19:39:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-24 19:39:19,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 3 [2024-10-24 19:39:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:39:19,779 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-24 19:39:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-24 19:39:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-24 19:39:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 19:39:19,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:39:19,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 19:39:19,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:39:19,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-24 19:39:19,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:39:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2692178, now seen corresponding path program 1 times [2024-10-24 19:39:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:39:19,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123366781] [2024-10-24 19:39:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:39:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:39:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:39:19,812 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-24 19:39:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:39:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123366781] [2024-10-24 19:39:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123366781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:39:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:39:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:39:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702468401] [2024-10-24 19:39:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:39:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:39:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:39:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:39:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:39:19,815 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:39:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:39:19,847 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-10-24 19:39:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:39:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 19:39:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:39:19,848 INFO L225 Difference]: With dead ends: 24 [2024-10-24 19:39:19,849 INFO L226 Difference]: Without dead ends: 22 [2024-10-24 19:39:19,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:39:19,853 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:39:19,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:39:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-24 19:39:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-24 19:39:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 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-24 19:39:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-24 19:39:19,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 4 [2024-10-24 19:39:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:39:19,859 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-24 19:39:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:39:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-24 19:39:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 19:39:19,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:39:19,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 19:39:19,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:39:19,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-24 19:39:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:39:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash 83457565, now seen corresponding path program 1 times [2024-10-24 19:39:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:39:19,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897384790] [2024-10-24 19:39:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:39:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:39:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:39:19,967 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-24 19:39:19,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:39:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897384790] [2024-10-24 19:39:19,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897384790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:39:19,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:39:19,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:39:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710244763] [2024-10-24 19:39:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:39:19,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:39:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:39:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:39:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:39:19,970 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:39:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:39:20,108 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-10-24 19:39:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:39:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 19:39:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:39:20,109 INFO L225 Difference]: With dead ends: 37 [2024-10-24 19:39:20,109 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 19:39:20,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:39:20,111 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:39:20,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:39:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 19:39:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2024-10-24 19:39:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 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-24 19:39:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-24 19:39:20,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2024-10-24 19:39:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:39:20,122 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-24 19:39:20,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:39:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-10-24 19:39:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 19:39:20,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:39:20,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:39:20,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:39:20,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-24 19:39:20,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:39:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1707782732, now seen corresponding path program 1 times [2024-10-24 19:39:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:39:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011041574] [2024-10-24 19:39:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:39:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:39:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:39:20,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:39:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:39:20,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:39:20,169 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:39:20,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-24 19:39:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-24 19:39:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-24 19:39:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-24 19:39:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-24 19:39:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-24 19:39:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-24 19:39:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-24 19:39:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-24 19:39:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-24 19:39:20,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:39:20,175 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 19:39:20,193 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:39:20,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:39:20 BoogieIcfgContainer [2024-10-24 19:39:20,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:39:20,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:39:20,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:39:20,200 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:39:20,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:39:19" (3/4) ... [2024-10-24 19:39:20,201 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 19:39:20,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:39:20,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:39:20,231 INFO L158 Benchmark]: Toolchain (without parser) took 1391.44ms. Allocated memory is still 159.4MB. Free memory was 117.8MB in the beginning and 49.5MB in the end (delta: 68.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-24 19:39:20,231 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 126.4MB in the end (delta: 268.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:39:20,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.91ms. Allocated memory is still 159.4MB. Free memory was 117.2MB in the beginning and 105.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 19:39:20,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.15ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 104.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:39:20,232 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:39:20,233 INFO L158 Benchmark]: RCFGBuilder took 328.62ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 90.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 19:39:20,233 INFO L158 Benchmark]: TraceAbstraction took 755.57ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 51.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 19:39:20,233 INFO L158 Benchmark]: Witness Printer took 30.80ms. Allocated memory is still 159.4MB. Free memory was 51.3MB in the beginning and 49.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:39:20,235 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.12ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 126.4MB in the end (delta: 268.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.91ms. Allocated memory is still 159.4MB. Free memory was 117.2MB in the beginning and 105.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.15ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 104.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.62ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 90.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 755.57ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 51.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 30.80ms. Allocated memory is still 159.4MB. Free memory was 51.3MB in the beginning and 49.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 19]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y; [L15] x = __VERIFIER_nondet_int() [L16] y = __VERIFIER_nondet_int() [L17] COND TRUE x >= 2 VAL [x=2, y=2147483647] [L18] EXPR x - 1 [L18] x = x - 1 VAL [x=1, y=2147483647] [L19] y + x - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 40 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-24 19:39:20,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)