./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-pe-ci_file-37.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 e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:28:19,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:28:19,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:28:19,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:28:19,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:28:19,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:28:19,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:28:19,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:28:19,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:28:19,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:28:19,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:28:19,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:28:19,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:28:19,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:28:19,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:28:19,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:28:19,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:28:19,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:28:19,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:28:19,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:19,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:28:19,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:28:19,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:28:19,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:28:19,389 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 -> e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 [2025-03-03 20:28:19,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:28:19,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:28:19,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:28:19,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:28:19,626 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:28:19,627 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-pe-ci_file-37.i [2025-03-03 20:28:20,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f647b5260/1b5c3429ecbe4c6c91076824933bcc39/FLAG77c40c331 [2025-03-03 20:28:21,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:28:21,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2025-03-03 20:28:21,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f647b5260/1b5c3429ecbe4c6c91076824933bcc39/FLAG77c40c331 [2025-03-03 20:28:21,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f647b5260/1b5c3429ecbe4c6c91076824933bcc39 [2025-03-03 20:28:21,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:28:21,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:28:21,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:21,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:28:21,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:28:21,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21, skipping insertion in model container [2025-03-03 20:28:21,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:28:21,207 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-pe-ci_file-37.i[919,932] [2025-03-03 20:28:21,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:21,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:28:21,271 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-pe-ci_file-37.i[919,932] [2025-03-03 20:28:21,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:21,303 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:28:21,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21 WrapperNode [2025-03-03 20:28:21,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:21,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:21,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:28:21,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:28:21,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,359 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2025-03-03 20:28:21,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:21,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:28:21,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:28:21,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:28:21,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,387 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-03 20:28:21,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:28:21,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:28:21,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:28:21,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:28:21,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (1/1) ... [2025-03-03 20:28:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:21,447 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-03 20:28:21,450 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-03 20:28:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:28:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:28:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:28:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:28:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:28:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:28:21,538 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:28:21,540 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:28:21,861 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:28:21,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:28:21,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:28:21,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:28:21,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:21 BoogieIcfgContainer [2025-03-03 20:28:21,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:28:21,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:28:21,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:28:21,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:28:21,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:28:21" (1/3) ... [2025-03-03 20:28:21,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4c6a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:21, skipping insertion in model container [2025-03-03 20:28:21,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:21" (2/3) ... [2025-03-03 20:28:21,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4c6a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:21, skipping insertion in model container [2025-03-03 20:28:21,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:21" (3/3) ... [2025-03-03 20:28:21,892 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2025-03-03 20:28:21,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:28:21,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:28:21,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:28:21,956 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;@7bc9f32d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:28:21,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:28:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 67 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:28:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:28:21,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:21,974 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:21,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:21,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1674930097, now seen corresponding path program 1 times [2025-03-03 20:28:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721965075] [2025-03-03 20:28:21,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:22,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:28:22,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:28:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 20:28:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721965075] [2025-03-03 20:28:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721965075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150920056] [2025-03-03 20:28:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:22,291 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-03 20:28:22,294 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-03 20:28:22,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:28:22,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:28:22,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:22,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:22,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:28:22,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 20:28:22,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150920056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:28:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:28:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073140158] [2025-03-03 20:28:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:22,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:28:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:22,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:28:22,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:28:22,538 INFO L87 Difference]: Start difference. First operand has 95 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 67 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:28:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:22,570 INFO L93 Difference]: Finished difference Result 184 states and 325 transitions. [2025-03-03 20:28:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:28:22,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-03-03 20:28:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:22,578 INFO L225 Difference]: With dead ends: 184 [2025-03-03 20:28:22,578 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 20:28:22,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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-03 20:28:22,585 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:22,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 20:28:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-03 20:28:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.4375) internal successors, (92), 64 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:28:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 144 transitions. [2025-03-03 20:28:22,624 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 144 transitions. Word has length 174 [2025-03-03 20:28:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 144 transitions. [2025-03-03 20:28:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:28:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions. [2025-03-03 20:28:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:28:22,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:22,635 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:22,642 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-03 20:28:22,836 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-03 20:28:22,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:22,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -694227823, now seen corresponding path program 1 times [2025-03-03 20:28:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613697280] [2025-03-03 20:28:22,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:22,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:28:22,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:28:22,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:22,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:28:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613697280] [2025-03-03 20:28:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613697280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:23,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608542741] [2025-03-03 20:28:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:23,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:23,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:23,199 INFO L87 Difference]: Start difference. First operand 92 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:23,238 INFO L93 Difference]: Finished difference Result 182 states and 287 transitions. [2025-03-03 20:28:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:28:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:23,243 INFO L225 Difference]: With dead ends: 182 [2025-03-03 20:28:23,243 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 20:28:23,244 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-03 20:28:23,244 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:23,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 20:28:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 20:28:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:28:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2025-03-03 20:28:23,260 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 174 [2025-03-03 20:28:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:23,261 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2025-03-03 20:28:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2025-03-03 20:28:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:28:23,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:23,265 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:28:23,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash -783809360, now seen corresponding path program 1 times [2025-03-03 20:28:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121399179] [2025-03-03 20:28:23,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:23,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:28:23,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:28:23,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:23,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:28:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121399179] [2025-03-03 20:28:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121399179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493782826] [2025-03-03 20:28:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:23,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:23,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:23,389 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:23,453 INFO L93 Difference]: Finished difference Result 244 states and 381 transitions. [2025-03-03 20:28:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:28:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:23,455 INFO L225 Difference]: With dead ends: 244 [2025-03-03 20:28:23,455 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 20:28:23,455 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-03 20:28:23,456 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:23,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 297 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 20:28:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-03 20:28:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 112 states have (on average 1.4553571428571428) internal successors, (163), 113 states have internal predecessors, (163), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:28:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2025-03-03 20:28:23,466 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 174 [2025-03-03 20:28:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:23,467 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2025-03-03 20:28:23,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2025-03-03 20:28:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:28:23,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:23,468 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:23,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:28:23,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -782885839, now seen corresponding path program 1 times [2025-03-03 20:28:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:23,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441269767] [2025-03-03 20:28:23,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:23,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:28:23,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:28:23,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:23,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:28:23,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:23,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441269767] [2025-03-03 20:28:23,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441269767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:23,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505707945] [2025-03-03 20:28:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:23,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:23,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:23,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:23,629 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:23,688 INFO L93 Difference]: Finished difference Result 369 states and 576 transitions. [2025-03-03 20:28:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:28:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:23,691 INFO L225 Difference]: With dead ends: 369 [2025-03-03 20:28:23,691 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 20:28:23,692 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-03 20:28:23,692 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 53 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:23,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 287 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 20:28:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 159. [2025-03-03 20:28:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:28:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2025-03-03 20:28:23,709 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 174 [2025-03-03 20:28:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:23,710 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2025-03-03 20:28:23,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2025-03-03 20:28:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:28:23,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:23,713 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:28:23,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:23,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1627357710, now seen corresponding path program 1 times [2025-03-03 20:28:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:23,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869650034] [2025-03-03 20:28:23,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:23,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:28:23,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:28:23,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:23,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:28:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869650034] [2025-03-03 20:28:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869650034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:23,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:23,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362540416] [2025-03-03 20:28:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:23,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:23,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:23,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:23,868 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:23,919 INFO L93 Difference]: Finished difference Result 379 states and 587 transitions. [2025-03-03 20:28:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:28:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:23,923 INFO L225 Difference]: With dead ends: 379 [2025-03-03 20:28:23,924 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 20:28:23,925 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-03 20:28:23,926 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 47 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:23,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 263 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 20:28:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-03-03 20:28:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 177 states have internal predecessors, (258), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:28:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 338 transitions. [2025-03-03 20:28:23,949 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 338 transitions. Word has length 174 [2025-03-03 20:28:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:23,949 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 338 transitions. [2025-03-03 20:28:23,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:28:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 338 transitions. [2025-03-03 20:28:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:28:23,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:23,951 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:23,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:28:23,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1584160981, now seen corresponding path program 1 times [2025-03-03 20:28:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887376081] [2025-03-03 20:28:23,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:23,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:28:24,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:28:24,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:24,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 42 proven. 33 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 20:28:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887376081] [2025-03-03 20:28:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887376081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656217603] [2025-03-03 20:28:24,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:24,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:24,423 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-03 20:28:24,424 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-03 20:28:24,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:28:24,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:28:24,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:24,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:24,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 20:28:24,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 682 proven. 60 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-03-03 20:28:25,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:28:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-03 20:28:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656217603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:28:25,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:28:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2025-03-03 20:28:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762804759] [2025-03-03 20:28:25,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:28:25,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 20:28:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:25,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 20:28:25,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-03-03 20:28:25,773 INFO L87 Difference]: Start difference. First operand 219 states and 338 transitions. Second operand has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 6 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2025-03-03 20:28:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:27,789 INFO L93 Difference]: Finished difference Result 1672 states and 2515 transitions. [2025-03-03 20:28:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-03 20:28:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 6 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 175 [2025-03-03 20:28:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:27,797 INFO L225 Difference]: With dead ends: 1672 [2025-03-03 20:28:27,797 INFO L226 Difference]: Without dead ends: 1456 [2025-03-03 20:28:27,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1438, Invalid=4414, Unknown=0, NotChecked=0, Total=5852 [2025-03-03 20:28:27,800 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1779 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:27,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 1193 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:28:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-03 20:28:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 734. [2025-03-03 20:28:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 579 states have (on average 1.4870466321243523) internal successors, (861), 586 states have internal predecessors, (861), 136 states have call successors, (136), 18 states have call predecessors, (136), 18 states have return successors, (136), 129 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 20:28:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1133 transitions. [2025-03-03 20:28:27,856 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1133 transitions. Word has length 175 [2025-03-03 20:28:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:27,857 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1133 transitions. [2025-03-03 20:28:27,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 6 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2025-03-03 20:28:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1133 transitions. [2025-03-03 20:28:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 20:28:27,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:27,859 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:27,865 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-03 20:28:28,063 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-03 20:28:28,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:28,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1725166959, now seen corresponding path program 1 times [2025-03-03 20:28:28,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:28,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861054818] [2025-03-03 20:28:28,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:28,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 20:28:28,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 20:28:28,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:28,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:28:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001583621] [2025-03-03 20:28:28,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:28,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:28,120 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-03 20:28:28,122 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-03 20:28:28,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 20:28:28,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 20:28:28,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:28,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:28:28,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:28:28,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 20:28:28,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 20:28:28,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:28,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:28:28,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:28:28,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:28:28,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:28:28,348 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-03 20:28:28,541 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-03 20:28:28,543 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:28:28,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:28:28,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:28:28 BoogieIcfgContainer [2025-03-03 20:28:28,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:28:28,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:28:28,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:28:28,628 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:28:28,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:21" (3/4) ... [2025-03-03 20:28:28,631 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:28:28,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:28:28,632 INFO L158 Benchmark]: Toolchain (without parser) took 7549.98ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 122.8MB in the beginning and 129.5MB in the end (delta: -6.7MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.68ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.40ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: Boogie Preprocessor took 59.35ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 97.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: IcfgBuilder took 462.49ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 66.8MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: TraceAbstraction took 6742.01ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 66.4MB in the beginning and 129.6MB in the end (delta: -63.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:28,633 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 209.7MB. Free memory was 129.6MB in the beginning and 129.5MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:28,634 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.68ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.40ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.35ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 97.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 462.49ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 66.8MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6742.01ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 66.4MB in the beginning and 129.6MB in the end (delta: -63.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 209.7MB. Free memory was 129.6MB in the beginning and 129.5MB in the end (delta: 64.6kB). 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 76, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed long int var_1_27 = 32; [L43] unsigned char var_1_28 = 64; [L44] signed char var_1_29 = 100; [L45] signed char var_1_30 = -1; [L46] signed char var_1_31 = 10; [L47] signed char var_1_32 = 5; [L48] signed char var_1_33 = 1; [L49] unsigned short int var_1_34 = 32; [L50] signed long int var_1_36 = -8; [L51] float last_1_var_1_10 = 7.25; [L52] double last_1_var_1_13 = 0.9; [L53] unsigned short int last_1_var_1_17 = 8; [L54] signed char last_1_var_1_19 = -128; VAL [isInitial=0, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_10 = var_1_10 [L177] last_1_var_1_13 = var_1_13 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L134] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L136] var_1_3 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_8 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L142] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=513/2] [L142] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=513/2] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L144] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L145] var_1_12 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L146] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L147] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L147] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L150] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L150] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L151] var_1_15 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && 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_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L152] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && 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_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L153] var_1_16 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_16 >= 0.0F && 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_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L154] RET assume_abort_if_not((var_1_16 >= 0.0F && 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_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L155] var_1_18 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L156] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L157] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L157] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L158] var_1_20 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L159] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L160] var_1_21 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L161] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L162] var_1_22 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L163] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L164] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L164] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L165] var_1_30 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L166] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L167] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L167] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L168] var_1_31 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L169] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L170] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L170] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L172] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L190] RET updateVariables() [L191] CALL step() [L58] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L59] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L70] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L71] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=5, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L75] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1] [L76] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L77] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L79] COND TRUE var_1_10 >= var_1_10 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L80] COND TRUE var_1_9 < var_1_10 [L81] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=256, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L84] COND TRUE (var_1_2 - var_1_3) > var_1_17 [L85] var_1_1 = (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L89] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L90] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_1=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L91] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L98] COND TRUE (~ (- var_1_3)) < var_1_2 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L99] COND FALSE !(var_1_2 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L103] COND TRUE var_1_8 > var_1_19 [L104] var_1_27 = ((((var_1_8) > (var_1_22)) ? (var_1_8) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=64, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L106] COND TRUE var_1_17 <= (((((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) < 0 ) ? -((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) : ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) [L107] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=100, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L109] COND TRUE var_1_12 <= 16 [L110] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L112] COND TRUE var_1_11 >= var_1_1 [L113] var_1_32 = ((((4) < (((((var_1_22) < ((var_1_31 - var_1_33))) ? (var_1_22) : ((var_1_31 - var_1_33)))))) ? (4) : (((((var_1_22) < ((var_1_31 - var_1_33))) ? (var_1_22) : ((var_1_31 - var_1_33))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L117] EXPR var_1_17 & var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L117] EXPR (var_1_17 & var_1_11) ^ var_1_12 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L117] EXPR var_1_19 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L117] COND FALSE !(((var_1_17 & var_1_11) ^ var_1_12) < (var_1_19 & var_1_33)) [L122] EXPR var_1_3 & (~ var_1_17) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L122] COND TRUE (var_1_3 & (~ var_1_17)) <= var_1_3 [L123] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=5, var_1_1=0, var_1_22=5, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=-98304, var_1_30=6, var_1_31=6, var_1_32=4, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1993 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1951 mSDsluCounter, 2454 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1573 mSDsCounter, 361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1189 IncrementalHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 361 mSolverCounterUnsat, 881 mSDtfsCounter, 1189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=734occurred in iteration=6, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 791 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1746 NumberOfCodeBlocks, 1746 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 4016 SizeOfPredicates, 6 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 11494/11700 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-03 20:28:28,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-pe-ci_file-37.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 e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:28:30,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:28:30,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:28:30,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:28:30,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:28:30,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:28:30,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:28:30,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:28:30,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:28:30,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:28:30,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:28:30,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:28:30,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:28:30,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:28:30,589 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:28:30,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:28:30,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:28:30,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:28:30,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:28:30,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:28:30,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:28:30,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:28:30,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:28:30,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:28:30,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:30,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:28:30,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:28:30,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:28:30,592 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 -> e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 [2025-03-03 20:28:30,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:28:30,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:28:30,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:28:30,849 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:28:30,849 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:28:30,850 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-pe-ci_file-37.i [2025-03-03 20:28:32,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4eaa2c0/239caea79bcc41dba8435b4f86fca06d/FLAG6b0ca624f [2025-03-03 20:28:32,244 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:28:32,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2025-03-03 20:28:32,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4eaa2c0/239caea79bcc41dba8435b4f86fca06d/FLAG6b0ca624f [2025-03-03 20:28:32,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4eaa2c0/239caea79bcc41dba8435b4f86fca06d [2025-03-03 20:28:32,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:28:32,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:28:32,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:32,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:28:32,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:28:32,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560c6172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32, skipping insertion in model container [2025-03-03 20:28:32,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:28:32,734 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-pe-ci_file-37.i[919,932] [2025-03-03 20:28:32,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:32,792 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:28:32,800 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-pe-ci_file-37.i[919,932] [2025-03-03 20:28:32,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:32,841 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:28:32,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32 WrapperNode [2025-03-03 20:28:32,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:32,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:32,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:28:32,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:28:32,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,882 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-03 20:28:32,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:32,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:28:32,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:28:32,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:28:32,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,912 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-03 20:28:32,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:28:32,933 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:28:32,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:28:32,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:28:32,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (1/1) ... [2025-03-03 20:28:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:32,963 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-03 20:28:32,966 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-03 20:28:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:28:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:28:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:28:32,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:28:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:28:32,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:28:33,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:28:33,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:28:49,580 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:28:49,581 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:28:49,588 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:28:49,588 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:28:49,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:49 BoogieIcfgContainer [2025-03-03 20:28:49,588 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:28:49,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:28:49,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:28:49,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:28:49,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:28:32" (1/3) ... [2025-03-03 20:28:49,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344ef29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:49, skipping insertion in model container [2025-03-03 20:28:49,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:32" (2/3) ... [2025-03-03 20:28:49,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344ef29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:49, skipping insertion in model container [2025-03-03 20:28:49,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:49" (3/3) ... [2025-03-03 20:28:49,596 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2025-03-03 20:28:49,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:28:49,607 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:28:49,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:28:49,658 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;@364ad2bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:28:49,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:28:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:28:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 20:28:49,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:49,676 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:49,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:49,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash -663994336, now seen corresponding path program 1 times [2025-03-03 20:28:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686260613] [2025-03-03 20:28:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:49,690 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-03 20:28:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:49,692 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-03 20:28:49,693 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-03 20:28:49,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 20:28:50,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 20:28:50,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:50,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:50,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:28:50,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-03 20:28:50,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:50,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686260613] [2025-03-03 20:28:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686260613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:28:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700608873] [2025-03-03 20:28:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:50,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:28:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:50,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:28:50,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:28:50,356 INFO L87 Difference]: Start difference. First operand has 82 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:28:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:50,375 INFO L93 Difference]: Finished difference Result 157 states and 279 transitions. [2025-03-03 20:28:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:28:50,377 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-03 20:28:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:50,381 INFO L225 Difference]: With dead ends: 157 [2025-03-03 20:28:50,382 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 20:28:50,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-03 20:28:50,386 INFO L435 NwaCegarLoop]: 120 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, 120 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-03 20:28:50,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 20:28:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 20:28:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:28:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-03 20:28:50,420 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 170 [2025-03-03 20:28:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-03 20:28:50,421 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:28:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-03 20:28:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 20:28:50,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:50,424 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:28:50,450 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 (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:28:50,624 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-03 20:28:50,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash -181861022, now seen corresponding path program 1 times [2025-03-03 20:28:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4439259] [2025-03-03 20:28:50,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:50,626 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-03 20:28:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:50,629 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-03 20:28:50,631 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-03 20:28:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 20:28:51,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 20:28:51,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:51,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:51,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:28:51,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 576 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 20:28:57,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:28:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 20:28:59,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4439259] [2025-03-03 20:28:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4439259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:28:59,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:28:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-03 20:28:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669955909] [2025-03-03 20:28:59,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:28:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:28:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:59,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:28:59,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:28:59,104 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 20:29:04,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:08,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:09,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:13,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:18,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:22,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:26,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:26,096 INFO L93 Difference]: Finished difference Result 159 states and 242 transitions. [2025-03-03 20:29:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:29:26,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 170 [2025-03-03 20:29:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:26,143 INFO L225 Difference]: With dead ends: 159 [2025-03-03 20:29:26,143 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 20:29:26,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:29:26,144 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 219 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 125 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:26,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 177 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 177 Invalid, 4 Unknown, 0 Unchecked, 26.1s Time] [2025-03-03 20:29:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 20:29:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-03-03 20:29:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:29:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2025-03-03 20:29:26,160 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 170 [2025-03-03 20:29:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:26,161 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2025-03-03 20:29:26,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 20:29:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2025-03-03 20:29:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 20:29:26,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:26,162 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:29:26,181 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-03 20:29:26,363 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-03 20:29:26,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:26,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -254348638, now seen corresponding path program 1 times [2025-03-03 20:29:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:26,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952220974] [2025-03-03 20:29:26,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:26,364 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-03 20:29:26,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:26,367 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-03 20:29:26,368 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-03 20:29:26,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 20:29:26,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 20:29:26,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:26,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:26,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:29:26,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:26,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:29:26,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:26,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952220974] [2025-03-03 20:29:26,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952220974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:26,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:26,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:29:26,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334551676] [2025-03-03 20:29:26,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:26,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:29:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:26,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:29:26,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:29:26,906 INFO L87 Difference]: Start difference. First operand 82 states and 122 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:31,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:31,330 INFO L93 Difference]: Finished difference Result 177 states and 263 transitions. [2025-03-03 20:29:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:29:31,331 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 20:29:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:31,332 INFO L225 Difference]: With dead ends: 177 [2025-03-03 20:29:31,332 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 20:29:31,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-03 20:29:31,333 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:31,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 20:29:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 20:29:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-03 20:29:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 20:29:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2025-03-03 20:29:31,349 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 171 [2025-03-03 20:29:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:31,349 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2025-03-03 20:29:31,349 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2025-03-03 20:29:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 20:29:31,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:31,351 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:29:31,371 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-03 20:29:31,552 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-03 20:29:31,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:31,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash -764882815, now seen corresponding path program 1 times [2025-03-03 20:29:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105781975] [2025-03-03 20:29:31,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:31,553 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-03 20:29:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:31,557 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-03 20:29:31,559 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-03 20:29:31,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 20:29:32,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 20:29:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:32,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:29:32,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:32,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:29:32,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105781975] [2025-03-03 20:29:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105781975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:32,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:32,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:29:32,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588577632] [2025-03-03 20:29:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:32,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:29:32,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:32,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:29:32,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:29:32,226 INFO L87 Difference]: Start difference. First operand 97 states and 142 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:36,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:40,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:40,460 INFO L93 Difference]: Finished difference Result 234 states and 336 transitions. [2025-03-03 20:29:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:29:40,460 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 20:29:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:40,463 INFO L225 Difference]: With dead ends: 234 [2025-03-03 20:29:40,463 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 20:29:40,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-03 20:29:40,465 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:40,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-03-03 20:29:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 20:29:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2025-03-03 20:29:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 100 states have internal predecessors, (126), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 20:29:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 212 transitions. [2025-03-03 20:29:40,479 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 212 transitions. Word has length 171 [2025-03-03 20:29:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 212 transitions. [2025-03-03 20:29:40,480 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 212 transitions. [2025-03-03 20:29:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 20:29:40,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:40,484 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:29:40,504 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-03 20:29:40,684 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-03 20:29:40,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:40,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash -763959294, now seen corresponding path program 1 times [2025-03-03 20:29:40,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:40,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060063003] [2025-03-03 20:29:40,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:40,686 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-03 20:29:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:40,687 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-03 20:29:40,688 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-03 20:29:40,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 20:29:41,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 20:29:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:41,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:41,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:29:41,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 232 proven. 138 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-03-03 20:29:44,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:29:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 141 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-03 20:29:46,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060063003] [2025-03-03 20:29:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060063003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:29:46,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:29:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-03 20:29:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265891985] [2025-03-03 20:29:46,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:29:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:29:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:46,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:29:46,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:29:46,816 INFO L87 Difference]: Start difference. First operand 148 states and 212 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 4 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 3 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 20:29:51,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:55,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:59,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []