./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:12:07,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:12:07,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:12:07,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:12:07,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:12:07,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:12:07,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:12:07,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:12:07,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:12:07,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:12:07,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:12:07,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:12:07,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:12:07,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:12:07,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:12:07,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:12:07,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:12:07,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:12:07,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:12:07,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 [2025-03-16 18:12:07,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:12:07,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:12:07,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:12:07,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:12:07,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:12:07,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2025-03-16 18:12:08,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18116126/86d192cae8a348609a8cfa9bd10124e2/FLAGdd8f7dfdc [2025-03-16 18:12:09,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:12:09,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2025-03-16 18:12:09,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18116126/86d192cae8a348609a8cfa9bd10124e2/FLAGdd8f7dfdc [2025-03-16 18:12:09,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18116126/86d192cae8a348609a8cfa9bd10124e2 [2025-03-16 18:12:09,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:12:09,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:12:09,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:12:09,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:12:09,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:12:09,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09, skipping insertion in model container [2025-03-16 18:12:09,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:12:09,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2025-03-16 18:12:09,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:12:09,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:12:09,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2025-03-16 18:12:09,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:12:09,560 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:12:09,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09 WrapperNode [2025-03-16 18:12:09,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:12:09,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:12:09,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:12:09,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:12:09,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,584 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2025-03-16 18:12:09,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:12:09,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:12:09,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:12:09,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:12:09,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,599 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 18:12:09,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:12:09,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:12:09,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:12:09,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:12:09,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (1/1) ... [2025-03-16 18:12:09,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:12:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:09,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:12:09,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:12:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:12:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 18:12:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 18:12:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:12:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:12:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:12:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:12:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:12:09,699 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:12:09,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:12:09,801 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-16 18:12:09,801 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:12:09,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:12:09,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:12:09,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:12:09 BoogieIcfgContainer [2025-03-16 18:12:09,807 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:12:09,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:12:09,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:12:09,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:12:09,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:12:09" (1/3) ... [2025-03-16 18:12:09,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:12:09, skipping insertion in model container [2025-03-16 18:12:09,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:12:09" (2/3) ... [2025-03-16 18:12:09,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:12:09, skipping insertion in model container [2025-03-16 18:12:09,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:12:09" (3/3) ... [2025-03-16 18:12:09,814 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2025-03-16 18:12:09,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:12:09,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat2-ll_unwindbound50.c that has 3 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:12:09,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:12:09,870 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;@ca0e833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:12:09,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:12:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:12:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 18:12:09,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:09,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:09,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:09,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1774886395, now seen corresponding path program 1 times [2025-03-16 18:12:09,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874125509] [2025-03-16 18:12:09,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:09,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 18:12:09,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 18:12:09,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:09,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:12:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874125509] [2025-03-16 18:12:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874125509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750530394] [2025-03-16 18:12:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:09,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:09,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:09,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:09,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:12:10,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 18:12:10,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 18:12:10,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:10,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:10,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 18:12:10,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:12:10,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:12:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750530394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:12:10,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:12:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 18:12:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275537634] [2025-03-16 18:12:10,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:12:10,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:12:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:10,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:12:10,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:12:10,052 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:12:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:10,062 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2025-03-16 18:12:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:12:10,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-16 18:12:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:10,066 INFO L225 Difference]: With dead ends: 44 [2025-03-16 18:12:10,067 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 18:12:10,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:12:10,070 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:10,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:12:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 18:12:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 18:12:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:12:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-16 18:12:10,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2025-03-16 18:12:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:10,091 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-16 18:12:10,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:12:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-16 18:12:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 18:12:10,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:10,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:10,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:12:10,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 18:12:10,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:10,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2078079995, now seen corresponding path program 1 times [2025-03-16 18:12:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107298407] [2025-03-16 18:12:10,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:10,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 18:12:10,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 18:12:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:12:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925683278] [2025-03-16 18:12:10,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:10,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:10,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:10,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:10,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:12:10,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 18:12:10,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 18:12:10,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:10,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:10,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 18:12:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:10,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:12:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107298407] [2025-03-16 18:12:10,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:12:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925683278] [2025-03-16 18:12:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925683278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:12:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:12:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:12:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752068546] [2025-03-16 18:12:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:12:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:12:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:10,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:12:10,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:12:10,568 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:12:12,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 18:12:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:12,326 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-16 18:12:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:12:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-16 18:12:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:12,327 INFO L225 Difference]: With dead ends: 32 [2025-03-16 18:12:12,327 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 18:12:12,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:12:12,328 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:12,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 18:12:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 18:12:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-16 18:12:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:12:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 18:12:12,333 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 18 [2025-03-16 18:12:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:12,335 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 18:12:12,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:12:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 18:12:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 18:12:12,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:12,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:12,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:12:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-16 18:12:12,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2078943934, now seen corresponding path program 1 times [2025-03-16 18:12:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767662216] [2025-03-16 18:12:12,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:12,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 18:12:12,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 18:12:12,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:12,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767662216] [2025-03-16 18:12:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767662216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:12:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:12:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:12:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470350105] [2025-03-16 18:12:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:12:12,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:12:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:12,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:12:12,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:12:12,648 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:12:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:12,663 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-16 18:12:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:12:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-16 18:12:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:12,665 INFO L225 Difference]: With dead ends: 38 [2025-03-16 18:12:12,665 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 18:12:12,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:12:12,666 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:12:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 18:12:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 18:12:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:12:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-16 18:12:12,674 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2025-03-16 18:12:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:12,674 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-16 18:12:12,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:12:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-16 18:12:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 18:12:12,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:12,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:12,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:12:12,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:12,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 770442274, now seen corresponding path program 1 times [2025-03-16 18:12:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277961658] [2025-03-16 18:12:12,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:12,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 18:12:12,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 18:12:12,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:12,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277961658] [2025-03-16 18:12:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277961658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741635466] [2025-03-16 18:12:12,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:12,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:12,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:12,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:12,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:12:12,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 18:12:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 18:12:12,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:12,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 18:12:12,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:13,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:12:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741635466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:12:13,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:12:13,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-03-16 18:12:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752034780] [2025-03-16 18:12:13,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:12:13,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:12:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:13,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:12:13,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:12:13,113 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-16 18:12:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:13,173 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-16 18:12:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:12:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2025-03-16 18:12:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:13,174 INFO L225 Difference]: With dead ends: 38 [2025-03-16 18:12:13,174 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 18:12:13,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:12:13,175 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:13,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 101 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:12:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 18:12:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2025-03-16 18:12:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:12:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-16 18:12:13,181 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 24 [2025-03-16 18:12:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:13,181 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-16 18:12:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-16 18:12:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-16 18:12:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 18:12:13,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:13,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:13,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:12:13,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:13,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:13,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1415919544, now seen corresponding path program 1 times [2025-03-16 18:12:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679557620] [2025-03-16 18:12:13,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:13,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:12:13,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:12:13,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:13,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:13,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679557620] [2025-03-16 18:12:13,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679557620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:13,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522002361] [2025-03-16 18:12:13,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:12:13,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:13,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:13,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:12:13,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:12:13,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:12:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:13,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:13,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:12:13,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:13,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:12:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522002361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:12:13,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:12:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-16 18:12:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924783944] [2025-03-16 18:12:13,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:12:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:12:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:13,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:12:13,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:12:13,580 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 18:12:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:13,637 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-03-16 18:12:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:12:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2025-03-16 18:12:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:13,638 INFO L225 Difference]: With dead ends: 56 [2025-03-16 18:12:13,638 INFO L226 Difference]: Without dead ends: 51 [2025-03-16 18:12:13,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:12:13,638 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:13,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:12:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-16 18:12:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-16 18:12:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 18:12:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-16 18:12:13,647 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 27 [2025-03-16 18:12:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:13,647 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-16 18:12:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 18:12:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-16 18:12:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 18:12:13,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:13,648 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:13,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 18:12:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:13,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 656559422, now seen corresponding path program 2 times [2025-03-16 18:12:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458446345] [2025-03-16 18:12:13,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:12:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:13,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-16 18:12:13,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 18:12:13,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:12:13,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:12:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458446345] [2025-03-16 18:12:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458446345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352302598] [2025-03-16 18:12:14,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:12:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:14,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:14,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:12:14,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-16 18:12:14,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 18:12:14,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:12:14,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:14,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:12:14,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:14,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:12:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:12:14,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352302598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:12:14,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:12:14,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-03-16 18:12:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660996273] [2025-03-16 18:12:14,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:12:14,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 18:12:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:14,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 18:12:14,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:12:14,302 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-16 18:12:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:14,488 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2025-03-16 18:12:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 18:12:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2025-03-16 18:12:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:14,489 INFO L225 Difference]: With dead ends: 110 [2025-03-16 18:12:14,489 INFO L226 Difference]: Without dead ends: 105 [2025-03-16 18:12:14,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-03-16 18:12:14,490 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:14,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 137 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:12:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-16 18:12:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-16 18:12:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-16 18:12:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2025-03-16 18:12:14,515 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2025-03-16 18:12:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:14,515 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2025-03-16 18:12:14,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-16 18:12:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2025-03-16 18:12:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:12:14,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:14,518 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:14,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 18:12:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:14,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:14,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1989547778, now seen corresponding path program 3 times [2025-03-16 18:12:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-16 18:12:14,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:12:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:14,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-03-16 18:12:14,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:12:14,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-16 18:12:14,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 18:12:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-16 18:12:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618203417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937053318] [2025-03-16 18:12:15,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:12:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:15,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:15,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:12:15,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-03-16 18:12:15,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:12:15,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-16 18:12:15,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:15,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 18:12:15,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:15,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:12:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 18:12:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937053318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:12:16,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:12:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 14] total 36 [2025-03-16 18:12:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284527676] [2025-03-16 18:12:16,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:12:16,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 18:12:16,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:16,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 18:12:16,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=739, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 18:12:16,137 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 36 states, 36 states have (on average 4.166666666666667) internal successors, (150), 36 states have internal predecessors, (150), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2025-03-16 18:12:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:16,572 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2025-03-16 18:12:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 18:12:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.166666666666667) internal successors, (150), 36 states have internal predecessors, (150), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) Word has length 108 [2025-03-16 18:12:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:16,574 INFO L225 Difference]: With dead ends: 218 [2025-03-16 18:12:16,574 INFO L226 Difference]: Without dead ends: 213 [2025-03-16 18:12:16,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=857, Invalid=1495, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 18:12:16,575 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 121 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:16,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 204 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:12:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-16 18:12:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-16 18:12:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 164 states have (on average 1.1402439024390243) internal successors, (187), 164 states have internal predecessors, (187), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 18:12:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 236 transitions. [2025-03-16 18:12:16,601 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 236 transitions. Word has length 108 [2025-03-16 18:12:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:16,602 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 236 transitions. [2025-03-16 18:12:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.166666666666667) internal successors, (150), 36 states have internal predecessors, (150), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2025-03-16 18:12:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2025-03-16 18:12:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 18:12:16,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:16,604 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:16,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 18:12:16,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:16,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -340905858, now seen corresponding path program 4 times [2025-03-16 18:12:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676633762] [2025-03-16 18:12:16,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:12:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:16,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 216 statements into 2 equivalence classes. [2025-03-16 18:12:16,870 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 18:12:16,870 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 18:12:16,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2025-03-16 18:12:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676633762] [2025-03-16 18:12:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676633762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310746365] [2025-03-16 18:12:18,143 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:12:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:18,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:18,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 18:12:18,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 216 statements into 2 equivalence classes. [2025-03-16 18:12:18,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 18:12:18,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 18:12:18,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:18,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-16 18:12:18,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:18,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:12:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2025-03-16 18:12:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310746365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:12:19,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:12:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 26] total 57 [2025-03-16 18:12:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306127784] [2025-03-16 18:12:19,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:12:19,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 18:12:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:19,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 18:12:19,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1269, Invalid=1923, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 18:12:19,311 INFO L87 Difference]: Start difference. First operand 213 states and 236 transitions. Second operand has 57 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 49 states have call successors, (74), 26 states have call predecessors, (74), 24 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) [2025-03-16 18:12:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:20,590 INFO L93 Difference]: Finished difference Result 434 states and 504 transitions. [2025-03-16 18:12:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-16 18:12:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 49 states have call successors, (74), 26 states have call predecessors, (74), 24 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) Word has length 216 [2025-03-16 18:12:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:20,594 INFO L225 Difference]: With dead ends: 434 [2025-03-16 18:12:20,597 INFO L226 Difference]: Without dead ends: 429 [2025-03-16 18:12:20,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3446, Invalid=6654, Unknown=0, NotChecked=0, Total=10100 [2025-03-16 18:12:20,600 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:20,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 402 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:12:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-16 18:12:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-16 18:12:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 332 states have (on average 1.141566265060241) internal successors, (379), 332 states have internal predecessors, (379), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 18:12:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 476 transitions. [2025-03-16 18:12:20,663 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 476 transitions. Word has length 216 [2025-03-16 18:12:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:20,663 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 476 transitions. [2025-03-16 18:12:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 49 states have call successors, (74), 26 states have call predecessors, (74), 24 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) [2025-03-16 18:12:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 476 transitions. [2025-03-16 18:12:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-16 18:12:20,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:20,672 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:20,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 18:12:20,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:20,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:20,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash -535101570, now seen corresponding path program 5 times [2025-03-16 18:12:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:20,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012812269] [2025-03-16 18:12:20,877 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:12:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:20,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 432 statements into 47 equivalence classes. [2025-03-16 18:12:21,086 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 18:12:21,086 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-16 18:12:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-03-16 18:12:24,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:12:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012812269] [2025-03-16 18:12:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012812269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:12:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876806395] [2025-03-16 18:12:24,018 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:12:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:24,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:24,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 18:12:24,071 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 432 statements into 47 equivalence classes. [2025-03-16 18:12:26,505 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 18:12:26,505 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-16 18:12:26,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:12:26,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-16 18:12:26,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:12:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:12:26,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:12:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-03-16 18:12:27,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876806395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:12:27,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:12:27,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 55 [2025-03-16 18:12:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408213174] [2025-03-16 18:12:27,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:12:27,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-16 18:12:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:12:27,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-16 18:12:27,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1590, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 18:12:27,992 INFO L87 Difference]: Start difference. First operand 429 states and 476 transitions. Second operand has 55 states, 55 states have (on average 6.472727272727273) internal successors, (356), 55 states have internal predecessors, (356), 51 states have call successors, (102), 49 states have call predecessors, (102), 48 states have return successors, (101), 50 states have call predecessors, (101), 50 states have call successors, (101) [2025-03-16 18:12:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:12:29,177 INFO L93 Difference]: Finished difference Result 470 states and 524 transitions. [2025-03-16 18:12:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-16 18:12:29,178 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.472727272727273) internal successors, (356), 55 states have internal predecessors, (356), 51 states have call successors, (102), 49 states have call predecessors, (102), 48 states have return successors, (101), 50 states have call predecessors, (101), 50 states have call successors, (101) Word has length 432 [2025-03-16 18:12:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:12:29,181 INFO L225 Difference]: With dead ends: 470 [2025-03-16 18:12:29,181 INFO L226 Difference]: Without dead ends: 465 [2025-03-16 18:12:29,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 816 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2025-03-16 18:12:29,184 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 218 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:12:29,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 362 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:12:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-16 18:12:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-16 18:12:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 360 states have internal predecessors, (411), 53 states have call successors, (53), 52 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 18:12:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 516 transitions. [2025-03-16 18:12:29,231 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 516 transitions. Word has length 432 [2025-03-16 18:12:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:12:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 516 transitions. [2025-03-16 18:12:29,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.472727272727273) internal successors, (356), 55 states have internal predecessors, (356), 51 states have call successors, (102), 49 states have call predecessors, (102), 48 states have return successors, (101), 50 states have call predecessors, (101), 50 states have call successors, (101) [2025-03-16 18:12:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 516 transitions. [2025-03-16 18:12:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 18:12:29,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:12:29,238 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:12:29,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 18:12:29,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-16 18:12:29,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:12:29,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:12:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash -329793026, now seen corresponding path program 6 times [2025-03-16 18:12:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:12:29,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565197473] [2025-03-16 18:12:29,440 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:12:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:12:29,452 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 468 statements into 51 equivalence classes. [2025-03-16 18:12:29,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 18:12:29,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-03-16 18:12:29,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:12:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729601047] [2025-03-16 18:12:29,747 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:12:29,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:12:29,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:12:29,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:12:29,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 18:12:29,798 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 468 statements into 51 equivalence classes. [2025-03-16 18:12:32,556 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 18:12:32,556 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-03-16 18:12:32,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:12:32,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 18:12:32,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 18:12:32,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 18:12:32,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:12:32,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:12:32,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 18:12:32,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 18:12:32,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:12:32,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 18:12:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 18:12:32,926 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2025-03-16 18:12:33,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:12:33,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:12:33 BoogieIcfgContainer [2025-03-16 18:12:33,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:12:33,024 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:12:33,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:12:33,025 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:12:33,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:12:09" (3/4) ... [2025-03-16 18:12:33,025 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 18:12:33,114 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 361. [2025-03-16 18:12:33,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:12:33,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:12:33,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:12:33,230 INFO L158 Benchmark]: Toolchain (without parser) took 23848.47ms. Allocated memory was 201.3MB in the beginning and 536.9MB in the end (delta: 335.5MB). Free memory was 155.3MB in the beginning and 461.6MB in the end (delta: -306.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2025-03-16 18:12:33,230 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:12:33,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.98ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 143.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:12:33,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.98ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 142.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:12:33,231 INFO L158 Benchmark]: Boogie Preprocessor took 25.49ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 141.7MB in the end (delta: 874.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:12:33,231 INFO L158 Benchmark]: IcfgBuilder took 196.00ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 129.8MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:12:33,231 INFO L158 Benchmark]: TraceAbstraction took 23214.85ms. Allocated memory was 201.3MB in the beginning and 536.9MB in the end (delta: 335.5MB). Free memory was 128.9MB in the beginning and 490.9MB in the end (delta: -362.0MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. [2025-03-16 18:12:33,231 INFO L158 Benchmark]: Witness Printer took 205.20ms. Allocated memory is still 536.9MB. Free memory was 490.9MB in the beginning and 461.6MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 18:12:33,232 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.98ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 143.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.98ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 142.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.49ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 141.7MB in the end (delta: 874.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 196.00ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 129.8MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23214.85ms. Allocated memory was 201.3MB in the beginning and 536.9MB in the end (delta: 335.5MB). Free memory was 128.9MB in the beginning and 490.9MB in the end (delta: -362.0MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. * Witness Printer took 205.20ms. Allocated memory is still 536.9MB. Free memory was 490.9MB in the beginning and 461.6MB in the end (delta: 29.3MB). Peak memory consumption was 25.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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=1565003, R=1252, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=1565003, R=1252, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=1565003, counter=0, r=2501, u=2505, v=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=1, r=2501, u=2505, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=1, r=2501, u=2505, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=1, r=2501, u=2505, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=1, r=2500, u=2505, v=3] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=2, r=2500, u=2505, v=3] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=2, r=2500, u=2505, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=2, r=2500, u=2505, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=2, r=2497, u=2505, v=5] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=3, r=2497, u=2505, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=3, r=2497, u=2505, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=3, r=2497, u=2505, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=3, r=2492, u=2505, v=7] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=4, r=2492, u=2505, v=7] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=4, r=2492, u=2505, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=4, r=2492, u=2505, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=4, r=2485, u=2505, v=9] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=5, r=2485, u=2505, v=9] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=5, r=2485, u=2505, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=5, r=2485, u=2505, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=5, r=2476, u=2505, v=11] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=6, r=2476, u=2505, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=6, r=2476, u=2505, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=6, r=2476, u=2505, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=6, r=2465, u=2505, v=13] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=7, r=2465, u=2505, v=13] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=7, r=2465, u=2505, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=7, r=2465, u=2505, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=7, r=2452, u=2505, v=15] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=8, r=2452, u=2505, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=8, r=2452, u=2505, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=8, r=2452, u=2505, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=8, r=2437, u=2505, v=17] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=9, r=2437, u=2505, v=17] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=9, r=2437, u=2505, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=9, r=2437, u=2505, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=9, r=2420, u=2505, v=19] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=10, r=2420, u=2505, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=10, r=2420, u=2505, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=10, r=2420, u=2505, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=10, r=2401, u=2505, v=21] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=11, r=2401, u=2505, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=11, r=2401, u=2505, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=11, r=2401, u=2505, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=11, r=2380, u=2505, v=23] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=12, r=2380, u=2505, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=12, r=2380, u=2505, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=12, r=2380, u=2505, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=12, r=2357, u=2505, v=25] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=13, r=2357, u=2505, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=13, r=2357, u=2505, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=13, r=2357, u=2505, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=13, r=2332, u=2505, v=27] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=14, r=2332, u=2505, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=14, r=2332, u=2505, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=14, r=2332, u=2505, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=14, r=2305, u=2505, v=29] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=15, r=2305, u=2505, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=15, r=2305, u=2505, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=15, r=2305, u=2505, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=15, r=2276, u=2505, v=31] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=16, r=2276, u=2505, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=16, r=2276, u=2505, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=16, r=2276, u=2505, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=16, r=2245, u=2505, v=33] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=17, r=2245, u=2505, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=17, r=2245, u=2505, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=17, r=2245, u=2505, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=17, r=2212, u=2505, v=35] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=18, r=2212, u=2505, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=18, r=2212, u=2505, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=18, r=2212, u=2505, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=18, r=2177, u=2505, v=37] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=19, r=2177, u=2505, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=19, r=2177, u=2505, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=19, r=2177, u=2505, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=19, r=2140, u=2505, v=39] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=20, r=2140, u=2505, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=20, r=2140, u=2505, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=20, r=2140, u=2505, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=20, r=2101, u=2505, v=41] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=21, r=2101, u=2505, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=21, r=2101, u=2505, v=41] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=21, r=2101, u=2505, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=21, r=2060, u=2505, v=43] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=22, r=2060, u=2505, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=22, r=2060, u=2505, v=43] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=22, r=2060, u=2505, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=22, r=2017, u=2505, v=45] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=23, r=2017, u=2505, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=23, r=2017, u=2505, v=45] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=23, r=2017, u=2505, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=23, r=1972, u=2505, v=47] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=24, r=1972, u=2505, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=24, r=1972, u=2505, v=47] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=24, r=1972, u=2505, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=24, r=1925, u=2505, v=49] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=25, r=1925, u=2505, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=25, r=1925, u=2505, v=49] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=25, r=1925, u=2505, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=25, r=1876, u=2505, v=51] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=26, r=1876, u=2505, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=26, r=1876, u=2505, v=51] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=26, r=1876, u=2505, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=26, r=1825, u=2505, v=53] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=27, r=1825, u=2505, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=27, r=1825, u=2505, v=53] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=27, r=1825, u=2505, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=27, r=1772, u=2505, v=55] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=28, r=1772, u=2505, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=28, r=1772, u=2505, v=55] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=28, r=1772, u=2505, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=28, r=1717, u=2505, v=57] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=29, r=1717, u=2505, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=29, r=1717, u=2505, v=57] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=29, r=1717, u=2505, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=29, r=1660, u=2505, v=59] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=30, r=1660, u=2505, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=30, r=1660, u=2505, v=59] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=30, r=1660, u=2505, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=30, r=1601, u=2505, v=61] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=31, r=1601, u=2505, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=31, r=1601, u=2505, v=61] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=31, r=1601, u=2505, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=31, r=1540, u=2505, v=63] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=32, r=1540, u=2505, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=32, r=1540, u=2505, v=63] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=32, r=1540, u=2505, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=32, r=1477, u=2505, v=65] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=33, r=1477, u=2505, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=33, r=1477, u=2505, v=65] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=33, r=1477, u=2505, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=33, r=1412, u=2505, v=67] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=34, r=1412, u=2505, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=34, r=1412, u=2505, v=67] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=34, r=1412, u=2505, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=34, r=1345, u=2505, v=69] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=35, r=1345, u=2505, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=35, r=1345, u=2505, v=69] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=35, r=1345, u=2505, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=35, r=1276, u=2505, v=71] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=36, r=1276, u=2505, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=36, r=1276, u=2505, v=71] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=36, r=1276, u=2505, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=36, r=1205, u=2505, v=73] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=37, r=1205, u=2505, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=37, r=1205, u=2505, v=73] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=37, r=1205, u=2505, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=37, r=1132, u=2505, v=75] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=38, r=1132, u=2505, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=38, r=1132, u=2505, v=75] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=38, r=1132, u=2505, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=38, r=1057, u=2505, v=77] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=39, r=1057, u=2505, v=77] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=39, r=1057, u=2505, v=77] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=39, r=1057, u=2505, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=39, r=980, u=2505, v=79] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=40, r=980, u=2505, v=79] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=40, r=980, u=2505, v=79] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=40, r=980, u=2505, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=40, r=901, u=2505, v=81] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=41, r=901, u=2505, v=81] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=41, r=901, u=2505, v=81] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=41, r=901, u=2505, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=41, r=820, u=2505, v=83] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=42, r=820, u=2505, v=83] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=42, r=820, u=2505, v=83] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=42, r=820, u=2505, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=42, r=737, u=2505, v=85] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=43, r=737, u=2505, v=85] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=43, r=737, u=2505, v=85] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=43, r=737, u=2505, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=43, r=652, u=2505, v=87] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=44, r=652, u=2505, v=87] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=44, r=652, u=2505, v=87] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=44, r=652, u=2505, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=44, r=565, u=2505, v=89] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=45, r=565, u=2505, v=89] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=45, r=565, u=2505, v=89] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=45, r=565, u=2505, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=45, r=476, u=2505, v=91] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=46, r=476, u=2505, v=91] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=46, r=476, u=2505, v=91] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=46, r=476, u=2505, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=46, r=385, u=2505, v=93] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=47, r=385, u=2505, v=93] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=47, r=385, u=2505, v=93] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=47, r=385, u=2505, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=47, r=292, u=2505, v=95] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=48, r=292, u=2505, v=95] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=48, r=292, u=2505, v=95] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=48, r=292, u=2505, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=48, r=197, u=2505, v=97] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=49, r=197, u=2505, v=97] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=49, r=197, u=2505, v=97] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=49, r=197, u=2505, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=49, r=100, u=2505, v=99] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=50, r=100, u=2505, v=99] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=50, r=100, u=2505, v=99] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=50, r=100, u=2505, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=50, r=1, u=2505, v=101] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1565003, counter=51, r=1, u=2505, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 34 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 1433 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1245 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 700 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 188 mSDtfsCounter, 700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1996 GetRequests, 1653 SyntacticMatches, 46 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4470 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=9, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2746 NumberOfCodeBlocks, 2746 NumberOfCodeBlocksAsserted, 235 NumberOfCheckSat, 2631 ConstructedInterpolants, 0 QuantifiedInterpolants, 6473 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2187 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 11123/36649 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 18:12:33,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE