./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.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 086de8df2449d866ff611c83674a9697b7d09f2a2b1c5c922e46b0c1131a7d5c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:11:42,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:11:42,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 11:11:42,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:11:42,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:11:42,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:11:42,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:11:42,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:11:42,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:11:42,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:11:42,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:11:42,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:11:42,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:11:42,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:11:42,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:11:42,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:11:42,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:11:42,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:11:42,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:11:42,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:11:42,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:11:42,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:11:42,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:11:42,423 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:11:42,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:11:42,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:11:42,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:11:42,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:11:42,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:11:42,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:11:42,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:11:42,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:11:42,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:11:42,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:11:42,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:11:42,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:11:42,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:11:42,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:11:42,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:11:42,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:11:42,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:11:42,428 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 -> 086de8df2449d866ff611c83674a9697b7d09f2a2b1c5c922e46b0c1131a7d5c [2024-11-09 11:11:42,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:11:42,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:11:42,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:11:42,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:11:42,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:11:42,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2024-11-09 11:11:44,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:11:44,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:11:44,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2024-11-09 11:11:44,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e22f0bd/af91db85bfb7408cb8783c7f6c063cf5/FLAG56b9448c9 [2024-11-09 11:11:44,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e22f0bd/af91db85bfb7408cb8783c7f6c063cf5 [2024-11-09 11:11:44,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:11:44,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:11:44,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:11:44,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:11:44,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:11:44,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae39d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44, skipping insertion in model container [2024-11-09 11:11:44,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:11:44,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:11:44,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:11:44,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:11:44,643 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:11:44,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44 WrapperNode [2024-11-09 11:11:44,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:11:44,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:11:44,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:11:44,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:11:44,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,673 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-09 11:11:44,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:11:44,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:11:44,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:11:44,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:11:44,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,686 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 11:11:44,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:11:44,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:11:44,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:11:44,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:11:44,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (1/1) ... [2024-11-09 11:11:44,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:11:44,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:11:44,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:11:44,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:11:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:11:44,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:11:44,850 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:11:44,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:11:44,952 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 11:11:44,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:11:44,967 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:11:44,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:11:44,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:11:44 BoogieIcfgContainer [2024-11-09 11:11:44,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:11:44,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:11:44,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:11:44,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:11:44,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:11:44" (1/3) ... [2024-11-09 11:11:44,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:11:44, skipping insertion in model container [2024-11-09 11:11:44,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:11:44" (2/3) ... [2024-11-09 11:11:44,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:11:44, skipping insertion in model container [2024-11-09 11:11:44,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:11:44" (3/3) ... [2024-11-09 11:11:44,977 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2024-11-09 11:11:44,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:11:44,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:11:45,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:11:45,053 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;@735e7262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:11:45,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:11:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:11:45,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:11:45,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:11:45,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:11:45,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:11:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 889513677, now seen corresponding path program 1 times [2024-11-09 11:11:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:11:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453497166] [2024-11-09 11:11:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:11:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:11:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:11:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453497166] [2024-11-09 11:11:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453497166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:11:45,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:11:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:11:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496095060] [2024-11-09 11:11:45,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:11:45,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:11:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:11:45,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:11:45,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:11:45,233 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:11:45,270 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-09 11:11:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:11:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 11:11:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:11:45,278 INFO L225 Difference]: With dead ends: 23 [2024-11-09 11:11:45,278 INFO L226 Difference]: Without dead ends: 12 [2024-11-09 11:11:45,280 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-11-09 11:11:45,283 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:11:45,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:11:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-09 11:11:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 11:11:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 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-11-09 11:11:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-09 11:11:45,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2024-11-09 11:11:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:11:45,327 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 11:11:45,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-09 11:11:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:11:45,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:11:45,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:11:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:11:45,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:11:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:11:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1805120262, now seen corresponding path program 1 times [2024-11-09 11:11:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:11:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2755778] [2024-11-09 11:11:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:11:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:45,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-11-09 11:11:45,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:11:45,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2755778] [2024-11-09 11:11:45,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2755778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:11:45,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:11:45,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:11:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198109972] [2024-11-09 11:11:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:11:45,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:11:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:11:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:11:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:11:45,393 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:11:45,411 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-11-09 11:11:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:11:45,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:11:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:11:45,412 INFO L225 Difference]: With dead ends: 17 [2024-11-09 11:11:45,412 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 11:11:45,413 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-11-09 11:11:45,414 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:11:45,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:11:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 11:11:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 11:11:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-09 11:11:45,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 7 [2024-11-09 11:11:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:11:45,421 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-09 11:11:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-09 11:11:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-09 11:11:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:11:45,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:11:45,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:11:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:11:45,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:11:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:11:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 124153327, now seen corresponding path program 1 times [2024-11-09 11:11:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:11:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72121607] [2024-11-09 11:11:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:11:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:11:45,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72121607] [2024-11-09 11:11:45,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72121607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:11:45,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:11:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:11:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077338794] [2024-11-09 11:11:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:11:45,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:11:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:11:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:11:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:11:45,494 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:11:45,512 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-11-09 11:11:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:11:45,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 11:11:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:11:45,513 INFO L225 Difference]: With dead ends: 17 [2024-11-09 11:11:45,514 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 11:11:45,514 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-11-09 11:11:45,516 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:11:45,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:11:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 11:11:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-09 11:11:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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-11-09 11:11:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-09 11:11:45,524 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2024-11-09 11:11:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:11:45,524 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-09 11:11:45,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-09 11:11:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-09 11:11:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:11:45,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:11:45,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:11:45,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:11:45,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:11:45,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:11:45,527 INFO L85 PathProgramCache]: Analyzing trace with hash -446214104, now seen corresponding path program 1 times [2024-11-09 11:11:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:11:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203603927] [2024-11-09 11:11:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:11:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:11:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:11:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203603927] [2024-11-09 11:11:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203603927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:11:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:11:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:11:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132857534] [2024-11-09 11:11:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:11:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:11:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:11:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:11:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:11:45,581 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:11:45,595 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-11-09 11:11:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:11:45,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 11:11:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:11:45,598 INFO L225 Difference]: With dead ends: 15 [2024-11-09 11:11:45,598 INFO L226 Difference]: Without dead ends: 14 [2024-11-09 11:11:45,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:11:45,600 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:11:45,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:11:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-09 11:11:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 11:11:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-09 11:11:45,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2024-11-09 11:11:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:11:45,610 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-09 11:11:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:11:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-09 11:11:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:11:45,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:11:45,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:11:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:11:45,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:11:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:11:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1132966669, now seen corresponding path program 1 times [2024-11-09 11:11:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:11:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298006267] [2024-11-09 11:11:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:11:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:11:45,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:11:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298006267] [2024-11-09 11:11:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298006267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:11:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540372862] [2024-11-09 11:11:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:45,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:11:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:11:45,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:11:45,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:11:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:45,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:11:45,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:11:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:11:45,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:11:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:11:45,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540372862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:11:45,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:11:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 11:11:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68269213] [2024-11-09 11:11:45,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:11:45,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:11:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:11:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:11:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:11:45,888 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-11-09 11:11:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:11:45,930 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-09 11:11:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:11:45,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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) Word has length 13 [2024-11-09 11:11:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:11:45,932 INFO L225 Difference]: With dead ends: 33 [2024-11-09 11:11:45,933 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:11:45,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:11:45,934 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:11:45,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:11:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:11:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:11:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-11-09 11:11:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 11:11:45,941 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2024-11-09 11:11:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:11:45,941 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 11:11:45,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-11-09 11:11:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 11:11:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:11:45,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:11:45,943 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-09 11:11:45,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:11:46,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:11:46,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:11:46,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:11:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1107323810, now seen corresponding path program 2 times [2024-11-09 11:11:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:11:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32065708] [2024-11-09 11:11:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:11:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:11:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:11:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 11:11:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:11:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32065708] [2024-11-09 11:11:46,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32065708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:11:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458431387] [2024-11-09 11:11:46,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:11:46,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:11:46,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:11:46,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:11:46,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:11:46,327 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:11:46,328 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:11:46,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:11:46,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:11:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 11:11:46,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:11:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 11:11:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458431387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:11:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:11:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-09 11:11:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114226025] [2024-11-09 11:11:46,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:11:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:11:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:11:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:11:46,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:11:46,495 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 11:11:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:11:46,522 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-09 11:11:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:11:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 31 [2024-11-09 11:11:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:11:46,526 INFO L225 Difference]: With dead ends: 32 [2024-11-09 11:11:46,526 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:11:46,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:11:46,527 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:11:46,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:11:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:11:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:11:46,528 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-11-09 11:11:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:11:46,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2024-11-09 11:11:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:11:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:11:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 11:11:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:11:46,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:11:46,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:11:46,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:11:46,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:11:46,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:11:46,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:11:46,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:11:46,740 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-09 11:11:46,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:11:46,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:11:46,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:11:46 BoogieIcfgContainer [2024-11-09 11:11:46,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:11:46,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:11:46,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:11:46,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:11:46,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:11:44" (3/4) ... [2024-11-09 11:11:46,809 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:11:46,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 11:11:46,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:11:46,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 11:11:46,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:11:46,894 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:11:46,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:11:46,894 INFO L158 Benchmark]: Toolchain (without parser) took 2465.05ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 118.0MB in the beginning and 135.3MB in the end (delta: -17.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-09 11:11:46,895 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:11:46,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.16ms. Allocated memory is still 176.2MB. Free memory was 118.0MB in the beginning and 106.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:11:46,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.33ms. Allocated memory is still 176.2MB. Free memory was 106.5MB in the beginning and 105.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:11:46,895 INFO L158 Benchmark]: Boogie Preprocessor took 19.97ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:11:46,895 INFO L158 Benchmark]: RCFGBuilder took 273.70ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 94.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:11:46,896 INFO L158 Benchmark]: TraceAbstraction took 1835.13ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 93.4MB in the beginning and 139.5MB in the end (delta: -46.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-09 11:11:46,896 INFO L158 Benchmark]: Witness Printer took 87.39ms. Allocated memory is still 228.6MB. Free memory was 139.5MB in the beginning and 135.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:11:46,898 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.21ms. Allocated memory is still 176.2MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.16ms. Allocated memory is still 176.2MB. Free memory was 118.0MB in the beginning and 106.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.33ms. Allocated memory is still 176.2MB. Free memory was 106.5MB in the beginning and 105.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.97ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 273.70ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 94.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1835.13ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 93.4MB in the beginning and 139.5MB in the end (delta: -46.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 87.39ms. Allocated memory is still 228.6MB. Free memory was 139.5MB in the beginning and 135.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: 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 1 procedures, 17 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 52 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 2 NumberOfNonLiveVariables, 44 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 132/168 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 4 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((0 <= v2) && (v1 <= 2147483647)) && (m <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:11:46,932 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 Result: TRUE