./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i -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 0c139e9da6bc1973aeb5aa6fa63324ad1af6ba8328267ab6771924e49569b825 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:50:01,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:50:01,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:50:01,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:50:01,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:50:01,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:50:01,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:50:01,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:50:01,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:50:01,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:50:01,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:50:01,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:50:01,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:50:01,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:50:01,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:50:01,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:50:01,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:50:01,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:50:01,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:50:01,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:50:01,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:50:01,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:50:01,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:50:01,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:50:01,674 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 -> 0c139e9da6bc1973aeb5aa6fa63324ad1af6ba8328267ab6771924e49569b825 [2025-03-08 12:50:01,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:50:01,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:50:01,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:50:01,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:50:01,902 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:50:01,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i [2025-03-08 12:50:03,053 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1da1ce74/5bd84d5990f640d4b1bf2f0f3eada665/FLAG6935ad56a [2025-03-08 12:50:03,300 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:50:03,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i [2025-03-08 12:50:03,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1da1ce74/5bd84d5990f640d4b1bf2f0f3eada665/FLAG6935ad56a [2025-03-08 12:50:03,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1da1ce74/5bd84d5990f640d4b1bf2f0f3eada665 [2025-03-08 12:50:03,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:50:03,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:50:03,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:50:03,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:50:03,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:50:03,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a317b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03, skipping insertion in model container [2025-03-08 12:50:03,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:50:03,444 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i[919,932] [2025-03-08 12:50:03,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:50:03,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:50:03,524 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i[919,932] [2025-03-08 12:50:03,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:50:03,571 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:50:03,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03 WrapperNode [2025-03-08 12:50:03,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:50:03,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:50:03,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:50:03,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:50:03,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,611 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-08 12:50:03,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:50:03,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:50:03,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:50:03,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:50:03,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,635 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-08 12:50:03,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:50:03,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:50:03,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:50:03,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:50:03,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (1/1) ... [2025-03-08 12:50:03,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:50:03,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:03,683 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-08 12:50:03,685 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-08 12:50:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:50:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:50:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:50:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:50:03,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:50:03,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:50:03,758 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:50:03,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:50:04,045 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 12:50:04,045 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:50:04,056 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:50:04,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:50:04,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:04 BoogieIcfgContainer [2025-03-08 12:50:04,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:50:04,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:50:04,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:50:04,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:50:04,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:50:03" (1/3) ... [2025-03-08 12:50:04,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bd50dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:04, skipping insertion in model container [2025-03-08 12:50:04,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:03" (2/3) ... [2025-03-08 12:50:04,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bd50dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:04, skipping insertion in model container [2025-03-08 12:50:04,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:04" (3/3) ... [2025-03-08 12:50:04,068 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i [2025-03-08 12:50:04,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:50:04,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:50:04,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:50:04,143 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;@6759f7bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:50:04,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:50:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:50:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:50:04,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:04,156 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:04,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:04,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1827886601, now seen corresponding path program 1 times [2025-03-08 12:50:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406573311] [2025-03-08 12:50:04,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:04,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:04,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:04,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:04,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 12:50:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:04,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406573311] [2025-03-08 12:50:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406573311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264905001] [2025-03-08 12:50:04,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:04,427 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-08 12:50:04,429 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-08 12:50:04,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:04,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:04,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:04,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:04,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:50:04,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 12:50:04,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264905001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:50:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:50:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966063954] [2025-03-08 12:50:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:50:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:04,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:50:04,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:50:04,645 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:04,668 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2025-03-08 12:50:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:50:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-03-08 12:50:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:04,676 INFO L225 Difference]: With dead ends: 137 [2025-03-08 12:50:04,677 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 12:50:04,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-08 12:50:04,682 INFO L435 NwaCegarLoop]: 104 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, 104 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-08 12:50:04,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:50:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 12:50:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 12:50:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:50:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-08 12:50:04,714 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 130 [2025-03-08 12:50:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-08 12:50:04,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-08 12:50:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:50:04,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:04,716 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:04,723 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-08 12:50:04,917 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-08 12:50:04,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash 578785099, now seen corresponding path program 1 times [2025-03-08 12:50:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:04,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465207691] [2025-03-08 12:50:04,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:04,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465207691] [2025-03-08 12:50:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465207691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:50:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195678867] [2025-03-08 12:50:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:05,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:50:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:50:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:50:05,118 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:05,176 INFO L93 Difference]: Finished difference Result 175 states and 268 transitions. [2025-03-08 12:50:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:50:05,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-08 12:50:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:05,178 INFO L225 Difference]: With dead ends: 175 [2025-03-08 12:50:05,178 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 12:50:05,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:50:05,179 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 61 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:05,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 197 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:50:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 12:50:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2025-03-08 12:50:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.451219512195122) internal successors, (119), 83 states have internal predecessors, (119), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:50:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2025-03-08 12:50:05,195 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 130 [2025-03-08 12:50:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2025-03-08 12:50:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2025-03-08 12:50:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:50:05,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:05,197 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:05,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:50:05,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash -265686772, now seen corresponding path program 1 times [2025-03-08 12:50:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003230744] [2025-03-08 12:50:05,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:05,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:05,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:05,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003230744] [2025-03-08 12:50:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003230744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:50:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353465767] [2025-03-08 12:50:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:05,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:50:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:50:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:50:05,553 INFO L87 Difference]: Start difference. First operand 107 states and 163 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:05,681 INFO L93 Difference]: Finished difference Result 305 states and 465 transitions. [2025-03-08 12:50:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:50:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-08 12:50:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:05,686 INFO L225 Difference]: With dead ends: 305 [2025-03-08 12:50:05,687 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 12:50:05,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:50:05,688 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 97 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:05,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 291 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:50:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 12:50:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 161. [2025-03-08 12:50:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 117 states have internal predecessors, (161), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 12:50:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 241 transitions. [2025-03-08 12:50:05,705 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 241 transitions. Word has length 130 [2025-03-08 12:50:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:05,706 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 241 transitions. [2025-03-08 12:50:05,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 241 transitions. [2025-03-08 12:50:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:05,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:05,710 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:50:05,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2139359159, now seen corresponding path program 1 times [2025-03-08 12:50:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743936392] [2025-03-08 12:50:05,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:05,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:05,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:05,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:05,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743936392] [2025-03-08 12:50:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743936392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:50:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771434868] [2025-03-08 12:50:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:50:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:06,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:50:06,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:50:06,083 INFO L87 Difference]: Start difference. First operand 161 states and 241 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:06,358 INFO L93 Difference]: Finished difference Result 455 states and 694 transitions. [2025-03-08 12:50:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:50:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 12:50:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:06,362 INFO L225 Difference]: With dead ends: 455 [2025-03-08 12:50:06,362 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 12:50:06,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:50:06,365 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 129 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:06,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 388 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:50:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 12:50:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 263. [2025-03-08 12:50:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 194 states have (on average 1.4123711340206186) internal successors, (274), 196 states have internal predecessors, (274), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 12:50:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2025-03-08 12:50:06,411 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 131 [2025-03-08 12:50:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:06,412 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2025-03-08 12:50:06,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2025-03-08 12:50:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:06,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:06,413 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:06,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:50:06,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -648056328, now seen corresponding path program 1 times [2025-03-08 12:50:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857429429] [2025-03-08 12:50:06,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:06,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:06,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:06,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857429429] [2025-03-08 12:50:06,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857429429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:06,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:06,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:50:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150412977] [2025-03-08 12:50:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:50:06,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:06,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:50:06,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:50:06,583 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:06,629 INFO L93 Difference]: Finished difference Result 469 states and 715 transitions. [2025-03-08 12:50:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:50:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 12:50:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:06,634 INFO L225 Difference]: With dead ends: 469 [2025-03-08 12:50:06,634 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 12:50:06,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:50:06,636 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:06,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:50:06,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 12:50:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-08 12:50:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 196 states have internal predecessors, (270), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 12:50:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2025-03-08 12:50:06,668 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 131 [2025-03-08 12:50:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:06,669 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2025-03-08 12:50:06,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2025-03-08 12:50:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:06,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:06,671 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:50:06,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:06,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1839456505, now seen corresponding path program 1 times [2025-03-08 12:50:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811326109] [2025-03-08 12:50:06,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:06,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:06,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:06,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:06,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:50:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811326109] [2025-03-08 12:50:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811326109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248913693] [2025-03-08 12:50:06,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:06,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:06,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:06,895 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-08 12:50:06,897 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-08 12:50:06,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:06,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:50:06,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 12:50:07,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:50:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248913693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:50:07,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:50:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 12:50:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25477671] [2025-03-08 12:50:07,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:07,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:50:07,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:07,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:50:07,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:50:07,370 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:50:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:07,556 INFO L93 Difference]: Finished difference Result 409 states and 607 transitions. [2025-03-08 12:50:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:50:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 131 [2025-03-08 12:50:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:07,560 INFO L225 Difference]: With dead ends: 409 [2025-03-08 12:50:07,560 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 12:50:07,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:50:07,561 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 93 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:07,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 196 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:50:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 12:50:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2025-03-08 12:50:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 130 states have internal predecessors, (166), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 12:50:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 274 transitions. [2025-03-08 12:50:07,592 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 274 transitions. Word has length 131 [2025-03-08 12:50:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:07,593 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 274 transitions. [2025-03-08 12:50:07,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:50:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 274 transitions. [2025-03-08 12:50:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:07,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:07,595 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:07,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:50:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 12:50:07,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2036929817, now seen corresponding path program 1 times [2025-03-08 12:50:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118638773] [2025-03-08 12:50:07,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:07,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:07,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:07,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:07,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 45 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-08 12:50:08,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:08,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118638773] [2025-03-08 12:50:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118638773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:08,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190233100] [2025-03-08 12:50:08,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:08,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:08,247 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-08 12:50:08,249 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-08 12:50:08,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:08,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:08,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:08,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:08,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 12:50:08,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-08 12:50:08,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 12:50:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190233100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:50:08,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:50:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-08 12:50:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193555435] [2025-03-08 12:50:08,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:50:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:08,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:50:08,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:50:08,960 INFO L87 Difference]: Start difference. First operand 192 states and 274 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-08 12:50:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:09,724 INFO L93 Difference]: Finished difference Result 559 states and 757 transitions. [2025-03-08 12:50:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 12:50:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 131 [2025-03-08 12:50:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:09,727 INFO L225 Difference]: With dead ends: 559 [2025-03-08 12:50:09,727 INFO L226 Difference]: Without dead ends: 490 [2025-03-08 12:50:09,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 12:50:09,730 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 328 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:09,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 700 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:50:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-08 12:50:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 300. [2025-03-08 12:50:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 210 states have (on average 1.2571428571428571) internal successors, (264), 210 states have internal predecessors, (264), 72 states have call successors, (72), 17 states have call predecessors, (72), 17 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 12:50:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 408 transitions. [2025-03-08 12:50:09,762 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 408 transitions. Word has length 131 [2025-03-08 12:50:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:09,763 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 408 transitions. [2025-03-08 12:50:09,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-08 12:50:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 408 transitions. [2025-03-08 12:50:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:09,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:09,765 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:09,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:50:09,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:09,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1531371192, now seen corresponding path program 1 times [2025-03-08 12:50:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353298889] [2025-03-08 12:50:09,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:09,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:10,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:10,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:10,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:50:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744000869] [2025-03-08 12:50:10,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:10,029 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-08 12:50:10,031 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-08 12:50:10,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:10,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:10,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:10,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:10,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 12:50:10,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:50:10,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353298889] [2025-03-08 12:50:10,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 12:50:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744000869] [2025-03-08 12:50:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744000869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:10,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:50:10,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-08 12:50:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325765398] [2025-03-08 12:50:10,856 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:50:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:10,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:50:10,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:50:10,857 INFO L87 Difference]: Start difference. First operand 300 states and 408 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:11,131 INFO L93 Difference]: Finished difference Result 770 states and 1037 transitions. [2025-03-08 12:50:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 12:50:11,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2025-03-08 12:50:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:11,134 INFO L225 Difference]: With dead ends: 770 [2025-03-08 12:50:11,134 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 12:50:11,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:50:11,137 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 102 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:11,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 463 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:50:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 12:50:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 473. [2025-03-08 12:50:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 336 states have (on average 1.2410714285714286) internal successors, (417), 336 states have internal predecessors, (417), 108 states have call successors, (108), 28 states have call predecessors, (108), 28 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 12:50:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 633 transitions. [2025-03-08 12:50:11,190 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 633 transitions. Word has length 131 [2025-03-08 12:50:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 633 transitions. [2025-03-08 12:50:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 633 transitions. [2025-03-08 12:50:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:11,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:11,192 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:11,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 12:50:11,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:11,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:11,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash -545838151, now seen corresponding path program 1 times [2025-03-08 12:50:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748502421] [2025-03-08 12:50:11,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:11,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:11,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:50:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175754052] [2025-03-08 12:50:11,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:11,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:11,438 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-08 12:50:11,439 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-08 12:50:11,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:11,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:11,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:11,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 12:50:11,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:50:11,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:12,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:50:12,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748502421] [2025-03-08 12:50:12,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 12:50:12,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175754052] [2025-03-08 12:50:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175754052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:12,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:50:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-08 12:50:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003298624] [2025-03-08 12:50:12,040 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:12,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:50:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:50:12,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:50:12,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:50:12,041 INFO L87 Difference]: Start difference. First operand 473 states and 633 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:12,562 INFO L93 Difference]: Finished difference Result 932 states and 1244 transitions. [2025-03-08 12:50:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:50:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2025-03-08 12:50:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:12,567 INFO L225 Difference]: With dead ends: 932 [2025-03-08 12:50:12,567 INFO L226 Difference]: Without dead ends: 702 [2025-03-08 12:50:12,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:50:12,572 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 94 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:12,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 503 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:50:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-08 12:50:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 630. [2025-03-08 12:50:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 447 states have (on average 1.2304250559284116) internal successors, (550), 447 states have internal predecessors, (550), 144 states have call successors, (144), 38 states have call predecessors, (144), 38 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 12:50:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 838 transitions. [2025-03-08 12:50:12,639 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 838 transitions. Word has length 131 [2025-03-08 12:50:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:12,639 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 838 transitions. [2025-03-08 12:50:12,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 838 transitions. [2025-03-08 12:50:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:50:12,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:12,641 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:12,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 12:50:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:12,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1596536437, now seen corresponding path program 1 times [2025-03-08 12:50:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:50:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129668657] [2025-03-08 12:50:12,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:50:12,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:50:12,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:50:12,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:50:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170265216] [2025-03-08 12:50:12,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:12,895 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-08 12:50:12,897 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-08 12:50:12,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:50:12,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:50:12,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:12,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:50:12,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:50:13,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:50:13,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:50:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:50:13,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:50:13,094 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:50:13,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:50:13,103 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-08 12:50:13,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:50:13,300 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:13,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:50:13,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:50:13 BoogieIcfgContainer [2025-03-08 12:50:13,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:50:13,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:50:13,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:50:13,368 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:50:13,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:04" (3/4) ... [2025-03-08 12:50:13,370 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:50:13,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:50:13,371 INFO L158 Benchmark]: Toolchain (without parser) took 10050.68ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.6MB in the beginning and 219.6MB in the end (delta: -95.0MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2025-03-08 12:50:13,371 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:50:13,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.62ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 109.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:50:13,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.27ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 105.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:50:13,371 INFO L158 Benchmark]: Boogie Preprocessor took 40.18ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 99.8MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:50:13,372 INFO L158 Benchmark]: IcfgBuilder took 401.01ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 74.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:50:13,372 INFO L158 Benchmark]: TraceAbstraction took 9305.65ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 73.4MB in the beginning and 219.6MB in the end (delta: -146.2MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-03-08 12:50:13,372 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 352.3MB. Free memory was 219.6MB in the beginning and 219.6MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:50:13,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.62ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 109.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.27ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 105.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.18ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 99.8MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 401.01ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 74.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9305.65ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 73.4MB in the beginning and 219.6MB in the end (delta: -146.2MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 352.3MB. Free memory was 219.6MB in the beginning and 219.6MB in the end (delta: 69.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_11 || var_1_8 [L56] var_1_21 = ((var_1_7 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L58] COND FALSE !(((var_1_1 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L61] COND TRUE (- var_1_15) < ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16))) [L62] var_1_30 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L64] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_1 [L65] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L67] COND TRUE var_1_6 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) [L68] var_1_34 = ((((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) > (var_1_7)) ? (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L70] COND TRUE \read(var_1_11) [L71] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L73] COND TRUE \read(var_1_11) [L74] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L78] COND TRUE (- var_1_7) != var_1_6 [L79] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L81] COND FALSE !(var_1_7 <= (~ var_1_7)) [L86] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L88] signed long int stepLocal_6 = last_1_var_1_1; [L89] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L90] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L91] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L94] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L99] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=10, var_1_7=-55, var_1_8=1] [L102] COND TRUE var_1_5 >= -2 [L103] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L105] unsigned char stepLocal_4 = var_1_6; [L106] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L107] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L108] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L109] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L116] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L117] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L120] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L121] COND TRUE \read(var_1_19) [L122] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L128] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L129] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=1] [L130] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L137] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=0] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-55, var_1_34=201, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=16, var_1_6=101, var_1_7=-55, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 130 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 928 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 3029 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2089 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1402 IncrementalHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 940 mSDtfsCounter, 1402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1059 GetRequests, 961 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=630occurred in iteration=9, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 451 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2094 NumberOfCodeBlocks, 2094 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1816 ConstructedInterpolants, 1 QuantifiedInterpolants, 6200 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1694 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 8189/8568 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 could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:50:13,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0c139e9da6bc1973aeb5aa6fa63324ad1af6ba8328267ab6771924e49569b825 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:50:15,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:50:15,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:50:15,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:50:15,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:50:15,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:50:15,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:50:15,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:50:15,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:50:15,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:50:15,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:50:15,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:50:15,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:50:15,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:50:15,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:50:15,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:50:15,358 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:50:15,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:50:15,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:50:15,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:50:15,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:50:15,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:50:15,361 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 -> 0c139e9da6bc1973aeb5aa6fa63324ad1af6ba8328267ab6771924e49569b825 [2025-03-08 12:50:15,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:50:15,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:50:15,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:50:15,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:50:15,604 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:50:15,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i [2025-03-08 12:50:16,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500760cbf/6a2d284cceed44b98fc2dbaccb74a4cf/FLAGfdfeaa3a7 [2025-03-08 12:50:16,936 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:50:16,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i [2025-03-08 12:50:16,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500760cbf/6a2d284cceed44b98fc2dbaccb74a4cf/FLAGfdfeaa3a7 [2025-03-08 12:50:17,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500760cbf/6a2d284cceed44b98fc2dbaccb74a4cf [2025-03-08 12:50:17,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:50:17,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:50:17,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:50:17,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:50:17,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:50:17,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88d5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17, skipping insertion in model container [2025-03-08 12:50:17,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:50:17,404 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i[919,932] [2025-03-08 12:50:17,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:50:17,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:50:17,478 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i[919,932] [2025-03-08 12:50:17,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:50:17,514 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:50:17,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17 WrapperNode [2025-03-08 12:50:17,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:50:17,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:50:17,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:50:17,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:50:17,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,551 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-03-08 12:50:17,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:50:17,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:50:17,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:50:17,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:50:17,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,580 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-08 12:50:17,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:50:17,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:50:17,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:50:17,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:50:17,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (1/1) ... [2025-03-08 12:50:17,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:50:17,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:50:17,631 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-08 12:50:17,637 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-08 12:50:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:50:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:50:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:50:17,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:50:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:50:17,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:50:17,723 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:50:17,725 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:50:18,145 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 12:50:18,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:50:18,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:50:18,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:50:18,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:18 BoogieIcfgContainer [2025-03-08 12:50:18,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:50:18,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:50:18,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:50:18,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:50:18,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:50:17" (1/3) ... [2025-03-08 12:50:18,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b2d647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:18, skipping insertion in model container [2025-03-08 12:50:18,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:17" (2/3) ... [2025-03-08 12:50:18,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b2d647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:18, skipping insertion in model container [2025-03-08 12:50:18,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:18" (3/3) ... [2025-03-08 12:50:18,163 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i [2025-03-08 12:50:18,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:50:18,174 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-42.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:50:18,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:50:18,217 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;@6d0fcfba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:50:18,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:50:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:50:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:50:18,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:18,227 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:18,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:18,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1827886601, now seen corresponding path program 1 times [2025-03-08 12:50:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:18,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199174399] [2025-03-08 12:50:18,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:18,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:18,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:18,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:18,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:50:18,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:18,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:18,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:18,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:18,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:50:18,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-08 12:50:18,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:18,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199174399] [2025-03-08 12:50:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199174399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:50:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466528148] [2025-03-08 12:50:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:18,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:50:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:18,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:50:18,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:50:18,583 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:18,598 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2025-03-08 12:50:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:50:18,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-03-08 12:50:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:18,604 INFO L225 Difference]: With dead ends: 137 [2025-03-08 12:50:18,604 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 12:50:18,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-08 12:50:18,609 INFO L435 NwaCegarLoop]: 104 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, 104 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-08 12:50:18,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:50:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 12:50:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 12:50:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:50:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-08 12:50:18,645 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 130 [2025-03-08 12:50:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:18,645 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-08 12:50:18,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-08 12:50:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:50:18,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:18,647 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:18,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:50:18,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:18,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:18,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash 578785099, now seen corresponding path program 1 times [2025-03-08 12:50:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254064660] [2025-03-08 12:50:18,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:18,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:18,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:18,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:50:18,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:19,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:19,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:19,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:19,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:50:19,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 12:50:19,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:50:19,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:19,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254064660] [2025-03-08 12:50:19,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254064660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:50:19,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:50:19,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:50:19,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252058617] [2025-03-08 12:50:19,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:19,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:50:19,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:19,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:50:19,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:50:19,443 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:50:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:19,717 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2025-03-08 12:50:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:50:19,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 130 [2025-03-08 12:50:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:19,719 INFO L225 Difference]: With dead ends: 149 [2025-03-08 12:50:19,719 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 12:50:19,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:50:19,720 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 96 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:19,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 204 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:50:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 12:50:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2025-03-08 12:50:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:50:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2025-03-08 12:50:19,735 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 130 [2025-03-08 12:50:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:19,736 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2025-03-08 12:50:19,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:50:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2025-03-08 12:50:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:50:19,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:19,738 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:19,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:50:19,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:19,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:19,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 987609324, now seen corresponding path program 1 times [2025-03-08 12:50:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:19,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135445033] [2025-03-08 12:50:19,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:19,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:19,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:19,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:19,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:50:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:50:20,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:50:20,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:20,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:20,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:50:20,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:20,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:20,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:20,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135445033] [2025-03-08 12:50:20,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135445033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:20,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:50:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984766910] [2025-03-08 12:50:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:20,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:50:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:20,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:50:20,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:50:20,327 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:20,533 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2025-03-08 12:50:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:50:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-08 12:50:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:20,540 INFO L225 Difference]: With dead ends: 211 [2025-03-08 12:50:20,541 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 12:50:20,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:50:20,542 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 90 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:20,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 283 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:50:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 12:50:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2025-03-08 12:50:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:50:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-03-08 12:50:20,565 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 130 [2025-03-08 12:50:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:20,565 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-03-08 12:50:20,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-03-08 12:50:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:20,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:20,567 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:20,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 12:50:20,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:20,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1958134825, now seen corresponding path program 1 times [2025-03-08 12:50:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031150623] [2025-03-08 12:50:20,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:20,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:20,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:20,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 12:50:20,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:20,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:50:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:21,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:21,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031150623] [2025-03-08 12:50:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031150623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:21,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:50:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779481574] [2025-03-08 12:50:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:21,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:50:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:21,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:50:21,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:50:21,444 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:22,167 INFO L93 Difference]: Finished difference Result 306 states and 446 transitions. [2025-03-08 12:50:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:50:22,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 12:50:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:22,174 INFO L225 Difference]: With dead ends: 306 [2025-03-08 12:50:22,174 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 12:50:22,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:50:22,175 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 118 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:22,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 376 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:50:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 12:50:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 188. [2025-03-08 12:50:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 127 states have internal predecessors, (163), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 12:50:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 271 transitions. [2025-03-08 12:50:22,210 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 271 transitions. Word has length 131 [2025-03-08 12:50:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:22,211 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 271 transitions. [2025-03-08 12:50:22,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 271 transitions. [2025-03-08 12:50:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:22,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:22,212 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:22,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 12:50:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:22,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:22,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash -450583016, now seen corresponding path program 1 times [2025-03-08 12:50:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822131105] [2025-03-08 12:50:22,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:22,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:22,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 12:50:22,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:22,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:22,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:22,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:22,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:50:22,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:22,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:22,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822131105] [2025-03-08 12:50:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822131105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:22,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:50:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:50:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54980227] [2025-03-08 12:50:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:22,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:50:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:22,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:50:22,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:50:22,668 INFO L87 Difference]: Start difference. First operand 188 states and 271 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:22,766 INFO L93 Difference]: Finished difference Result 324 states and 470 transitions. [2025-03-08 12:50:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:50:22,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 12:50:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:22,769 INFO L225 Difference]: With dead ends: 324 [2025-03-08 12:50:22,769 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 12:50:22,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:50:22,770 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:22,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:50:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 12:50:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-08 12:50:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 12:50:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 269 transitions. [2025-03-08 12:50:22,788 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 269 transitions. Word has length 131 [2025-03-08 12:50:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:22,789 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 269 transitions. [2025-03-08 12:50:22,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 269 transitions. [2025-03-08 12:50:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:22,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:22,791 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:22,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 12:50:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:22,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2036929817, now seen corresponding path program 1 times [2025-03-08 12:50:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959987603] [2025-03-08 12:50:22,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:22,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:22,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:22,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:22,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 12:50:23,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:23,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:23,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 12:50:23,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-08 12:50:23,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 12:50:23,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959987603] [2025-03-08 12:50:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959987603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:50:23,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:50:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-08 12:50:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829520546] [2025-03-08 12:50:23,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:23,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:50:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:23,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:50:23,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:50:23,689 INFO L87 Difference]: Start difference. First operand 188 states and 269 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-08 12:50:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:24,393 INFO L93 Difference]: Finished difference Result 393 states and 532 transitions. [2025-03-08 12:50:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 12:50:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 131 [2025-03-08 12:50:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:24,396 INFO L225 Difference]: With dead ends: 393 [2025-03-08 12:50:24,396 INFO L226 Difference]: Without dead ends: 324 [2025-03-08 12:50:24,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 12:50:24,397 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 278 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:24,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 492 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:50:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-08 12:50:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 296. [2025-03-08 12:50:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 207 states have (on average 1.251207729468599) internal successors, (259), 207 states have internal predecessors, (259), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 12:50:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 403 transitions. [2025-03-08 12:50:24,419 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 403 transitions. Word has length 131 [2025-03-08 12:50:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 403 transitions. [2025-03-08 12:50:24,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-08 12:50:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 403 transitions. [2025-03-08 12:50:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:24,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:24,422 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:24,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 12:50:24,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:24,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:24,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1531371192, now seen corresponding path program 1 times [2025-03-08 12:50:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:24,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397682440] [2025-03-08 12:50:24,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:24,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:24,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 12:50:24,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:24,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:24,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:50:24,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:50:25,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:25,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397682440] [2025-03-08 12:50:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397682440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2086322469] [2025-03-08 12:50:25,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:50:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:50:25,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:50:25,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-08 12:50:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:26,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:26,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:26,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:26,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:50:26,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:26,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:26,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2086322469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:26,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:50:26,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 12:50:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126220971] [2025-03-08 12:50:26,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:50:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:26,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:50:26,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:50:26,478 INFO L87 Difference]: Start difference. First operand 296 states and 403 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:27,707 INFO L93 Difference]: Finished difference Result 793 states and 1073 transitions. [2025-03-08 12:50:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:50:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 12:50:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:27,710 INFO L225 Difference]: With dead ends: 793 [2025-03-08 12:50:27,711 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 12:50:27,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:50:27,712 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 138 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:27,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 446 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:50:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 12:50:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 569. [2025-03-08 12:50:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 408 states have (on average 1.2598039215686274) internal successors, (514), 410 states have internal predecessors, (514), 130 states have call successors, (130), 30 states have call predecessors, (130), 30 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 12:50:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 774 transitions. [2025-03-08 12:50:27,753 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 774 transitions. Word has length 131 [2025-03-08 12:50:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:27,754 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 774 transitions. [2025-03-08 12:50:27,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 774 transitions. [2025-03-08 12:50:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:50:27,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:27,755 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:27,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-08 12:50:27,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-03-08 12:50:28,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:28,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:28,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1237968185, now seen corresponding path program 1 times [2025-03-08 12:50:28,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:28,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613543613] [2025-03-08 12:50:28,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:28,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:28,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:28,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:28,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 12:50:28,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:28,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:28,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:28,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:28,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:50:28,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:50:28,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:29,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613543613] [2025-03-08 12:50:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613543613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [209922017] [2025-03-08 12:50:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:50:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:50:29,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:50:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-08 12:50:29,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:50:29,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:50:29,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:29,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:29,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:50:29,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:50:30,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:50:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [209922017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:50:30,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:50:30,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-08 12:50:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755551314] [2025-03-08 12:50:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:50:30,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:50:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:30,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:50:30,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:50:30,116 INFO L87 Difference]: Start difference. First operand 569 states and 774 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:31,169 INFO L93 Difference]: Finished difference Result 1275 states and 1735 transitions. [2025-03-08 12:50:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:50:31,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 12:50:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:31,173 INFO L225 Difference]: With dead ends: 1275 [2025-03-08 12:50:31,174 INFO L226 Difference]: Without dead ends: 760 [2025-03-08 12:50:31,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:50:31,176 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:31,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 370 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 12:50:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-08 12:50:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 718. [2025-03-08 12:50:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 513 states have (on average 1.2456140350877194) internal successors, (639), 515 states have internal predecessors, (639), 166 states have call successors, (166), 38 states have call predecessors, (166), 38 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 12:50:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 971 transitions. [2025-03-08 12:50:31,228 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 971 transitions. Word has length 131 [2025-03-08 12:50:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:31,229 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 971 transitions. [2025-03-08 12:50:31,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:50:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 971 transitions. [2025-03-08 12:50:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:50:31,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:31,230 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:31,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-08 12:50:31,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-08 12:50:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:31,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:31,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1627556244, now seen corresponding path program 1 times [2025-03-08 12:50:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105691101] [2025-03-08 12:50:31,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:31,633 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:31,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-08 12:50:31,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:50:31,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:50:31,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:31,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:31,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:50:31,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:50:32,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:33,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:50:33,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105691101] [2025-03-08 12:50:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105691101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [708968055] [2025-03-08 12:50:33,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:33,013 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:50:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:50:33,022 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:50:33,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-08 12:50:33,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:50:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:50:33,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:33,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:50:33,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:50:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:50:33,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:50:34,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [708968055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:50:34,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:50:34,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-08 12:50:34,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426459960] [2025-03-08 12:50:34,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:50:34,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:50:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:50:34,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:50:34,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:50:34,491 INFO L87 Difference]: Start difference. First operand 718 states and 971 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:50:34,860 INFO L93 Difference]: Finished difference Result 1625 states and 2177 transitions. [2025-03-08 12:50:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:50:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2025-03-08 12:50:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:50:34,864 INFO L225 Difference]: With dead ends: 1625 [2025-03-08 12:50:34,864 INFO L226 Difference]: Without dead ends: 958 [2025-03-08 12:50:34,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:50:34,866 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 89 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:50:34,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 251 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:50:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-03-08 12:50:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 922. [2025-03-08 12:50:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 665 states have (on average 1.2360902255639097) internal successors, (822), 668 states have internal predecessors, (822), 204 states have call successors, (204), 52 states have call predecessors, (204), 52 states have return successors, (204), 201 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-08 12:50:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1230 transitions. [2025-03-08 12:50:34,914 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1230 transitions. Word has length 132 [2025-03-08 12:50:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:50:34,914 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1230 transitions. [2025-03-08 12:50:34,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:50:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1230 transitions. [2025-03-08 12:50:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:50:34,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:50:34,915 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:50:34,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2025-03-08 12:50:35,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-03-08 12:50:35,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:35,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:50:35,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:50:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1596536437, now seen corresponding path program 1 times [2025-03-08 12:50:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:50:35,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884283504] [2025-03-08 12:50:35,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:50:35,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:50:35,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:50:35,320 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:50:35,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-08 12:50:35,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:50:35,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:50:35,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:50:35,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:50:35,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 12:50:35,505 INFO L279 TraceCheckSpWp]: Computing forward predicates...