./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/MutualRecursion_1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:12:54,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:12:54,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:12:54,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:12:54,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:12:54,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:12:54,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:12:54,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:12:54,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:12:54,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:12:54,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:12:54,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:12:54,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:12:54,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:12:54,710 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:12:54,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:12:54,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:12:54,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:12:54,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:12:54,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:12:54,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:12:54,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:12:54,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:12:54,713 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:12:54,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:12:54,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:12:54,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:12:54,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:12:54,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:12:54,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:12:54,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:12:54,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:12:54,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:12:54,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:12:54,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:12:54,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:12:54,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:12:54,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:12:54,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:12:54,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:12:54,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:12:54,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 [2024-10-11 20:12:54,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:12:54,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:12:54,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:12:54,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:12:54,924 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:12:54,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2024-10-11 20:12:56,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:12:56,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:12:56,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2024-10-11 20:12:56,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5216ca4d9/fd8e94429ed1426a8ce7819ca8fff405/FLAGf39405ff5 [2024-10-11 20:12:56,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5216ca4d9/fd8e94429ed1426a8ce7819ca8fff405 [2024-10-11 20:12:56,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:12:56,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:12:56,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:12:56,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:12:56,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:12:56,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dec80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56, skipping insertion in model container [2024-10-11 20:12:56,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:12:56,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:12:56,441 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:12:56,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:12:56,463 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:12:56,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56 WrapperNode [2024-10-11 20:12:56,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:12:56,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:12:56,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:12:56,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:12:56,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,498 INFO L138 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2024-10-11 20:12:56,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:12:56,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:12:56,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:12:56,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:12:56,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,517 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:12:56,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:12:56,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:12:56,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:12:56,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:12:56,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (1/1) ... [2024-10-11 20:12:56,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:12:56,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:56,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:12:56,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:12:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 20:12:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 20:12:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-10-11 20:12:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-10-11 20:12:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:12:56,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:12:56,662 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:12:56,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:12:56,759 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 20:12:56,759 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:12:56,773 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:12:56,773 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 20:12:56,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:56 BoogieIcfgContainer [2024-10-11 20:12:56,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:12:56,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:12:56,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:12:56,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:12:56,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:12:56" (1/3) ... [2024-10-11 20:12:56,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a467b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:56, skipping insertion in model container [2024-10-11 20:12:56,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:56" (2/3) ... [2024-10-11 20:12:56,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a467b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:56, skipping insertion in model container [2024-10-11 20:12:56,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:56" (3/3) ... [2024-10-11 20:12:56,783 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a.c [2024-10-11 20:12:56,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:12:56,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 20:12:56,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:12:56,850 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;@7c1fd972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:12:56,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 20:12:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 32 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:12:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:12:56,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:56,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:12:56,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash 83879668, now seen corresponding path program 1 times [2024-10-11 20:12:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163324365] [2024-10-11 20:12:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163324365] [2024-10-11 20:12:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163324365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:57,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:12:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729483334] [2024-10-11 20:12:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:57,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:12:57,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:12:57,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:12:57,040 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 32 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:57,082 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-11 20:12:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:12:57,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:12:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:57,089 INFO L225 Difference]: With dead ends: 42 [2024-10-11 20:12:57,089 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:12:57,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:12:57,094 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:57,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:12:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-11 20:12:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 29 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:12:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-11 20:12:57,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 5 [2024-10-11 20:12:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:57,123 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-11 20:12:57,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-11 20:12:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:12:57,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:57,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:12:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:12:57,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1694697532, now seen corresponding path program 1 times [2024-10-11 20:12:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925229316] [2024-10-11 20:12:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925229316] [2024-10-11 20:12:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925229316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:57,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:12:57,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983883829] [2024-10-11 20:12:57,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:57,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:12:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:12:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:12:57,199 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:57,277 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-10-11 20:12:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:12:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:12:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:57,279 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:12:57,279 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 20:12:57,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:12:57,280 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:57,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 20:12:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-10-11 20:12:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:12:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-10-11 20:12:57,295 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2024-10-11 20:12:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:57,295 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-10-11 20:12:57,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-10-11 20:12:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:12:57,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:57,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:57,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:12:57,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:57,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,301 INFO L85 PathProgramCache]: Analyzing trace with hash 570216194, now seen corresponding path program 1 times [2024-10-11 20:12:57,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085220387] [2024-10-11 20:12:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085220387] [2024-10-11 20:12:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085220387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:12:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280238099] [2024-10-11 20:12:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:12:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:57,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:12:57,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:12:57,441 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:57,600 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-10-11 20:12:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:12:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:12:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:57,604 INFO L225 Difference]: With dead ends: 70 [2024-10-11 20:12:57,604 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 20:12:57,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:12:57,606 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:57,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 156 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:12:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 20:12:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-10-11 20:12:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:12:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-10-11 20:12:57,618 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 14 [2024-10-11 20:12:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:57,618 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-10-11 20:12:57,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-10-11 20:12:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:12:57,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:57,622 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:12:57,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1778504853, now seen corresponding path program 1 times [2024-10-11 20:12:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407071286] [2024-10-11 20:12:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:12:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:12:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407071286] [2024-10-11 20:12:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407071286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:12:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938629362] [2024-10-11 20:12:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:57,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:12:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:12:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:12:57,657 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:12:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:57,667 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-10-11 20:12:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:12:57,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 20:12:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:57,668 INFO L225 Difference]: With dead ends: 61 [2024-10-11 20:12:57,668 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 20:12:57,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:12:57,669 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:57,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 20:12:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-11 20:12:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:12:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-10-11 20:12:57,681 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 16 [2024-10-11 20:12:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:57,682 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-10-11 20:12:57,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:12:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-10-11 20:12:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:12:57,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:57,684 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:57,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:12:57,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:57,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2131483704, now seen corresponding path program 1 times [2024-10-11 20:12:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554343175] [2024-10-11 20:12:57,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:12:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 20:12:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:12:57,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554343175] [2024-10-11 20:12:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554343175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:12:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017930102] [2024-10-11 20:12:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:57,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:12:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:12:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:12:57,776 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:12:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:57,818 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2024-10-11 20:12:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:12:57,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 20:12:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:57,820 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:12:57,820 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 20:12:57,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:12:57,821 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:57,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 123 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 20:12:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-10-11 20:12:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2024-10-11 20:12:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-10-11 20:12:57,834 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2024-10-11 20:12:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:57,835 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-10-11 20:12:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:12:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-10-11 20:12:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:12:57,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:57,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:12:57,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1651485452, now seen corresponding path program 1 times [2024-10-11 20:12:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581656037] [2024-10-11 20:12:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:12:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 20:12:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:12:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581656037] [2024-10-11 20:12:57,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581656037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:57,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:57,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:12:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387159208] [2024-10-11 20:12:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:57,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:12:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:12:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:12:57,922 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:12:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:57,963 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-10-11 20:12:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:12:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-11 20:12:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:57,964 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:12:57,967 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 20:12:57,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:12:57,968 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:57,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 20:12:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-10-11 20:12:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-11 20:12:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2024-10-11 20:12:57,983 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2024-10-11 20:12:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:57,983 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2024-10-11 20:12:57,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:12:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2024-10-11 20:12:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:12:57,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:57,985 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:57,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:12:57,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1194784516, now seen corresponding path program 1 times [2024-10-11 20:12:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528677782] [2024-10-11 20:12:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:12:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:12:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:12:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528677782] [2024-10-11 20:12:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528677782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:12:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775618408] [2024-10-11 20:12:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:58,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:58,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:58,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:12:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:12:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:12:58,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:12:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:12:58,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:12:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775618408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:58,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:12:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-10-11 20:12:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017681754] [2024-10-11 20:12:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:58,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:12:58,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:58,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:12:58,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:12:58,194 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:12:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:58,242 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2024-10-11 20:12:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:12:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-10-11 20:12:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:58,244 INFO L225 Difference]: With dead ends: 149 [2024-10-11 20:12:58,244 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:12:58,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:12:58,246 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:58,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 82 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:12:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 20:12:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-11 20:12:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2024-10-11 20:12:58,260 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 24 [2024-10-11 20:12:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:58,260 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2024-10-11 20:12:58,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:12:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2024-10-11 20:12:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 20:12:58,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:58,262 INFO L215 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:12:58,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:12:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:58,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-10-11 20:12:58,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -681782982, now seen corresponding path program 1 times [2024-10-11 20:12:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401425974] [2024-10-11 20:12:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:12:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:12:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:12:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 20:12:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:12:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:12:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:12:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:12:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:12:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:12:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401425974] [2024-10-11 20:12:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401425974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:12:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610840427] [2024-10-11 20:12:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:58,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:58,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:58,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:12:58,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:12:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:58,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:12:58,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:12:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:12:58,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:12:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:12:58,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610840427] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:12:58,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:12:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-10-11 20:12:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493183531] [2024-10-11 20:12:58,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:12:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:12:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:12:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:12:58,971 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 7 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 20:12:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:59,042 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2024-10-11 20:12:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:12:59,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 7 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 94 [2024-10-11 20:12:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:59,043 INFO L225 Difference]: With dead ends: 117 [2024-10-11 20:12:59,043 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:12:59,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:12:59,045 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:59,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 70 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:12:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:12:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:12:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:12:59,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2024-10-11 20:12:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:59,046 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:12:59,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 7 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 20:12:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:12:59,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:12:59,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-11 20:12:59,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-11 20:12:59,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-11 20:12:59,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-11 20:12:59,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-11 20:12:59,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-11 20:12:59,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-11 20:12:59,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-11 20:12:59,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-11 20:12:59,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-11 20:12:59,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:12:59,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:59,255 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:59,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:12:59,414 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:12:59,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:12:59 BoogieIcfgContainer [2024-10-11 20:12:59,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:12:59,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:12:59,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:12:59,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:12:59,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:56" (3/4) ... [2024-10-11 20:12:59,434 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:12:59,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2024-10-11 20:12:59,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2024-10-11 20:12:59,439 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 20:12:59,439 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:12:59,439 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:12:59,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:12:59,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:12:59,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:12:59,503 INFO L158 Benchmark]: Toolchain (without parser) took 3210.22ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 87.1MB in the beginning and 173.2MB in the end (delta: -86.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:12:59,503 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:12:59,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.18ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 75.9MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:12:59,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.94ms. Allocated memory is still 159.4MB. Free memory was 75.9MB in the beginning and 74.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:12:59,504 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 73.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:12:59,504 INFO L158 Benchmark]: RCFGBuilder took 247.49ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 73.1MB in the beginning and 175.7MB in the end (delta: -102.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-11 20:12:59,504 INFO L158 Benchmark]: TraceAbstraction took 2654.82ms. Allocated memory is still 211.8MB. Free memory was 174.6MB in the beginning and 177.3MB in the end (delta: -2.7MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2024-10-11 20:12:59,505 INFO L158 Benchmark]: Witness Printer took 71.68ms. Allocated memory is still 211.8MB. Free memory was 177.3MB in the beginning and 173.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:12:59,506 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.15ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.18ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 75.9MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.94ms. Allocated memory is still 159.4MB. Free memory was 75.9MB in the beginning and 74.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 73.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.49ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 73.1MB in the beginning and 175.7MB in the end (delta: -102.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2654.82ms. Allocated memory is still 211.8MB. Free memory was 174.6MB in the beginning and 177.3MB in the end (delta: -2.7MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. * Witness Printer took 71.68ms. Allocated memory is still 211.8MB. Free memory was 177.3MB in the beginning and 173.2MB 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 40 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 561 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 248 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 238 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 1 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 522/534 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 10 specifications checked. All of them hold - ProcedureContractResult [Line: 11]: Procedure Contract for f Derived contract for procedure f. Requires: (x <= 2147483646) Ensures: ((x <= 0) && (\result == 0)) - ProcedureContractResult [Line: 17]: Procedure Contract for g Derived contract for procedure g. Requires: (x <= 2147483647) Ensures: (x < 2) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:12:59,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE