./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-60.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 4522cafd10108830f4028637c15db89d8703937d55b769a0038439601d5d221c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:58:01,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:58:01,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:58:01,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:58:01,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:58:02,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:58:02,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:58:02,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:58:02,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:58:02,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:58:02,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:58:02,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:58:02,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:58:02,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:58:02,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:58:02,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:02,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:58:02,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:58:02,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:58:02,006 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 -> 4522cafd10108830f4028637c15db89d8703937d55b769a0038439601d5d221c [2025-03-16 22:58:02,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:58:02,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:58:02,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:58:02,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:58:02,261 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:58:02,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-60.i [2025-03-16 22:58:03,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769511d51/c6930dce50c5400b857560a86f63646d/FLAG5f8c03b23 [2025-03-16 22:58:03,587 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:58:03,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-60.i [2025-03-16 22:58:03,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769511d51/c6930dce50c5400b857560a86f63646d/FLAG5f8c03b23 [2025-03-16 22:58:03,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769511d51/c6930dce50c5400b857560a86f63646d [2025-03-16 22:58:03,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:58:03,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:58:03,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:03,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:58:03,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:58:03,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:03" (1/1) ... [2025-03-16 22:58:03,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f39a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:03, skipping insertion in model container [2025-03-16 22:58:03,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:03" (1/1) ... [2025-03-16 22:58:03,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:58:04,072 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_codestructure_dependencies_file-60.i[919,932] [2025-03-16 22:58:04,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:04,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:58:04,142 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_codestructure_dependencies_file-60.i[919,932] [2025-03-16 22:58:04,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:04,188 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:58:04,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04 WrapperNode [2025-03-16 22:58:04,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:04,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:04,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:58:04,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:58:04,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,231 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-03-16 22:58:04,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:04,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:58:04,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:58:04,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:58:04,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:58:04,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:58:04,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:58:04,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:58:04,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:58:04,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (1/1) ... [2025-03-16 22:58:04,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:04,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:58:04,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:58:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:58:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:58:04,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:58:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:58:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:58:04,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:58:04,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:58:04,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:58:04,605 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:58:04,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:58:04,616 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:58:04,618 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:58:04,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:04 BoogieIcfgContainer [2025-03-16 22:58:04,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:58:04,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:58:04,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:58:04,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:58:04,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:58:03" (1/3) ... [2025-03-16 22:58:04,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee48370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:04, skipping insertion in model container [2025-03-16 22:58:04,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:04" (2/3) ... [2025-03-16 22:58:04,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee48370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:04, skipping insertion in model container [2025-03-16 22:58:04,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:04" (3/3) ... [2025-03-16 22:58:04,625 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-60.i [2025-03-16 22:58:04,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:58:04,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-60.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:58:04,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:58:04,683 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;@48c52d5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:58:04,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:58:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:58:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:58:04,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:04,701 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:04,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:04,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1652846429, now seen corresponding path program 1 times [2025-03-16 22:58:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490876446] [2025-03-16 22:58:04,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:04,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:58:04,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:58:04,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:04,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 22:58:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:04,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490876446] [2025-03-16 22:58:04,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490876446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:58:04,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322455784] [2025-03-16 22:58:04,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:04,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:58:04,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:58:05,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:58:05,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:58:05,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:05,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:05,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:58:05,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 22:58:05,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:58:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322455784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:05,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:58:05,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:58:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554716363] [2025-03-16 22:58:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:05,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:58:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:05,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:58:05,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:05,117 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:58:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:05,132 INFO L93 Difference]: Finished difference Result 115 states and 206 transitions. [2025-03-16 22:58:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:58:05,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2025-03-16 22:58:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:05,137 INFO L225 Difference]: With dead ends: 115 [2025-03-16 22:58:05,137 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 22:58:05,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:05,141 INFO L435 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:05,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 22:58:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-16 22:58:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:58:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2025-03-16 22:58:05,170 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 88 transitions. Word has length 134 [2025-03-16 22:58:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:05,170 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 88 transitions. [2025-03-16 22:58:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:58:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 88 transitions. [2025-03-16 22:58:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:58:05,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:05,173 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:05,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:58:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 22:58:05,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1118474233, now seen corresponding path program 1 times [2025-03-16 22:58:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096511632] [2025-03-16 22:58:05,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:05,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:58:05,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:58:05,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:05,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:58:05,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096511632] [2025-03-16 22:58:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096511632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:58:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964853387] [2025-03-16 22:58:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:05,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:58:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:05,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:58:05,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:58:05,588 INFO L87 Difference]: Start difference. First operand 57 states and 88 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:58:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:05,623 INFO L93 Difference]: Finished difference Result 148 states and 228 transitions. [2025-03-16 22:58:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:58:05,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 134 [2025-03-16 22:58:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:05,625 INFO L225 Difference]: With dead ends: 148 [2025-03-16 22:58:05,625 INFO L226 Difference]: Without dead ends: 92 [2025-03-16 22:58:05,626 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-16 22:58:05,626 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:05,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-16 22:58:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-03-16 22:58:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-16 22:58:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-03-16 22:58:05,640 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 134 [2025-03-16 22:58:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-03-16 22:58:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:58:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-03-16 22:58:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 22:58:05,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:05,643 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:05,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:58:05,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:05,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1257526162, now seen corresponding path program 1 times [2025-03-16 22:58:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152207732] [2025-03-16 22:58:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:05,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:58:05,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:58:05,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:05,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:58:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504257683] [2025-03-16 22:58:05,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:05,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:05,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:58:05,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:58:05,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:58:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:58:05,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:05,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:05,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 22:58:05,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-03-16 22:58:06,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:58:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152207732] [2025-03-16 22:58:06,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 22:58:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504257683] [2025-03-16 22:58:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504257683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:58:06,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:58:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-16 22:58:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173653005] [2025-03-16 22:58:06,720 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 22:58:06,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:58:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:06,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:58:06,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:58:06,721 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:58:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:07,016 INFO L93 Difference]: Finished difference Result 253 states and 388 transitions. [2025-03-16 22:58:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 22:58:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-16 22:58:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:07,019 INFO L225 Difference]: With dead ends: 253 [2025-03-16 22:58:07,019 INFO L226 Difference]: Without dead ends: 165 [2025-03-16 22:58:07,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2025-03-16 22:58:07,023 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 89 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:07,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 287 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:58:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-16 22:58:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2025-03-16 22:58:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-16 22:58:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 203 transitions. [2025-03-16 22:58:07,053 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 203 transitions. Word has length 135 [2025-03-16 22:58:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:07,054 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 203 transitions. [2025-03-16 22:58:07,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:58:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 203 transitions. [2025-03-16 22:58:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 22:58:07,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:07,059 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:07,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:58:07,263 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,SelfDestructingSolverStorable2 [2025-03-16 22:58:07,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:07,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1454039667, now seen corresponding path program 1 times [2025-03-16 22:58:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:07,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96304261] [2025-03-16 22:58:07,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:07,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:58:07,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:58:07,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:07,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:58:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654885032] [2025-03-16 22:58:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:07,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:58:07,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:58:07,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:58:07,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:58:07,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:07,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:58:07,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:58:07,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:58:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:58:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:58:07,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:58:07,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:58:07,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:58:07,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:58:07,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:07,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 22:58:07,852 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:58:07,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:58:07 BoogieIcfgContainer [2025-03-16 22:58:07,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:58:07,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:58:07,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:58:07,857 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:58:07,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:04" (3/4) ... [2025-03-16 22:58:07,859 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:58:07,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:58:07,860 INFO L158 Benchmark]: Toolchain (without parser) took 3910.73ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 61.5MB in the end (delta: 70.6MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2025-03-16 22:58:07,861 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:07,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.84ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 118.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:58:07,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 115.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:07,863 INFO L158 Benchmark]: Boogie Preprocessor took 49.73ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 112.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:58:07,863 INFO L158 Benchmark]: IcfgBuilder took 332.80ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 93.1MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:58:07,863 INFO L158 Benchmark]: TraceAbstraction took 3236.84ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 61.6MB in the end (delta: 30.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2025-03-16 22:58:07,863 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 167.8MB. Free memory was 61.6MB in the beginning and 61.5MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:58:07,864 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.84ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 118.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 115.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.73ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 112.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 332.80ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 93.1MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3236.84ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 61.6MB in the end (delta: 30.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 167.8MB. Free memory was 61.6MB in the beginning and 61.5MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. 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 100, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_4 = 7.8; [L25] signed short int var_1_6 = 16; [L26] signed short int var_1_7 = 256; [L27] float var_1_8 = 256.6; [L28] unsigned char var_1_9 = 50; [L29] unsigned char var_1_10 = 5; [L30] double var_1_11 = 127.75; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] double var_1_15 = 15.2; [L35] double var_1_16 = 256.5; [L36] double var_1_17 = 256.5; [L37] double var_1_18 = 0.0; [L38] double var_1_19 = 9.7; [L39] unsigned long int var_1_20 = 10000000; [L40] unsigned long int var_1_21 = 4008920074; [L41] signed short int last_1_var_1_1 = 32; [L42] unsigned char last_1_var_1_9 = 50; [L43] double last_1_var_1_11 = 127.75; [L44] double last_1_var_1_16 = 256.5; [L45] unsigned long int last_1_var_1_20 = 10000000; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L132] last_1_var_1_1 = var_1_1 [L133] last_1_var_1_9 = var_1_9 [L134] last_1_var_1_11 = var_1_11 [L135] last_1_var_1_16 = var_1_16 [L136] last_1_var_1_20 = var_1_20 [L146] RET updateLastVariables() [L147] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L96] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] var_1_4 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] var_1_6 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] var_1_7 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L106] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L107] var_1_10 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L108] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L109] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L110] var_1_12 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L111] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L112] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L113] var_1_13 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L114] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L115] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L116] var_1_14 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L117] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L118] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L118] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L119] var_1_15 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L120] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L121] var_1_17 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L123] var_1_18 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L125] var_1_19 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L127] var_1_21 = __VERIFIER_nondet_ulong() [L128] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L129] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L129] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L147] RET updateVariables() [L148] CALL step() [L49] COND FALSE !(((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > last_1_var_1_20) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L52] COND FALSE !((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) [L59] var_1_11 = var_1_15 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=50] [L61] COND FALSE !(last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) [L68] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] [L70] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] [L73] COND TRUE var_1_9 >= var_1_9 [L74] var_1_20 = (var_1_21 - var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=8589934588, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] [L79] COND FALSE !((- var_1_16) <= var_1_4) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=8589934588, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] [L84] COND FALSE !(\read(var_1_2)) [L91] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=8589934588, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] [L148] RET step() [L149] CALL, EXPR property() [L139-L140] return (((((var_1_2 ? (((var_1_11 / var_1_4) <= var_1_8) ? (var_1_1 == ((signed short int) (var_1_9 - var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) && (((- var_1_16) <= var_1_4) ? (((var_1_11 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) ? ((((((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > last_1_var_1_20) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9))) : ((var_1_9 >= var_1_9) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_9)))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=8589934588, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=-255, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=8589934588, var_1_21=8589934590, var_1_2=0, var_1_6=-1, var_1_7=0, var_1_8=1283/5, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 115 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 574 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 266 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=3, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 1652 SizeOfPredicates, 6 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 3618/3696 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-16 22:58:07,878 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_codestructure_dependencies_file-60.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 4522cafd10108830f4028637c15db89d8703937d55b769a0038439601d5d221c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:58:09,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:58:09,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:58:09,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:58:09,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:58:09,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:58:09,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:58:09,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:58:09,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:58:09,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:58:09,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:58:09,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:58:09,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:58:09,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:58:09,759 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:58:09,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:58:09,760 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:58:09,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:09,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:58:09,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:58:09,761 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 -> 4522cafd10108830f4028637c15db89d8703937d55b769a0038439601d5d221c [2025-03-16 22:58:09,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:58:10,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:58:10,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:58:10,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:58:10,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:58:10,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-60.i [2025-03-16 22:58:11,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd4a031c/5517c94019d845c89c229a6988fb4ed7/FLAGa0623e9cd [2025-03-16 22:58:11,360 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:58:11,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-60.i [2025-03-16 22:58:11,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd4a031c/5517c94019d845c89c229a6988fb4ed7/FLAGa0623e9cd [2025-03-16 22:58:11,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd4a031c/5517c94019d845c89c229a6988fb4ed7 [2025-03-16 22:58:11,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:58:11,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:58:11,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:11,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:58:11,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:58:11,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:11,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2031bc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11, skipping insertion in model container [2025-03-16 22:58:11,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:11,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:58:11,874 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_codestructure_dependencies_file-60.i[919,932] [2025-03-16 22:58:11,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:11,931 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:58:11,940 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_codestructure_dependencies_file-60.i[919,932] [2025-03-16 22:58:11,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:11,987 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:58:11,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11 WrapperNode [2025-03-16 22:58:11,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:11,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:11,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:58:11,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:58:11,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,018 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2025-03-16 22:58:12,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:12,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:58:12,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:58:12,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:58:12,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,039 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:58:12,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:58:12,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:58:12,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:58:12,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:58:12,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (1/1) ... [2025-03-16 22:58:12,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:12,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:58:12,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:58:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:58:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:58:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:58:12,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:58:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:58:12,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:58:12,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:58:12,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:58:26,645 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:58:26,647 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:58:26,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:58:26,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:58:26,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:26 BoogieIcfgContainer [2025-03-16 22:58:26,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:58:26,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:58:26,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:58:26,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:58:26,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:58:11" (1/3) ... [2025-03-16 22:58:26,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd44127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:26, skipping insertion in model container [2025-03-16 22:58:26,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:11" (2/3) ... [2025-03-16 22:58:26,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd44127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:26, skipping insertion in model container [2025-03-16 22:58:26,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:26" (3/3) ... [2025-03-16 22:58:26,660 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-60.i [2025-03-16 22:58:26,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:58:26,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-60.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:58:26,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:58:26,723 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;@498ee292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:58:26,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:58:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:58:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:58:26,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:26,738 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:26,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1652846429, now seen corresponding path program 1 times [2025-03-16 22:58:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:58:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455489382] [2025-03-16 22:58:26,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:26,756 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-16 22:58:26,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:58:26,758 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-16 22:58:26,761 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-16 22:58:26,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:58:27,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:58:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:27,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:58:27,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-16 22:58:27,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:58:27,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:58:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455489382] [2025-03-16 22:58:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455489382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:58:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948370713] [2025-03-16 22:58:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:27,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:58:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:58:27,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:58:27,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:27,765 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:58:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:27,787 INFO L93 Difference]: Finished difference Result 115 states and 206 transitions. [2025-03-16 22:58:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:58:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2025-03-16 22:58:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:27,793 INFO L225 Difference]: With dead ends: 115 [2025-03-16 22:58:27,794 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 22:58:27,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:27,798 INFO L435 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:27,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 22:58:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-16 22:58:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:58:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2025-03-16 22:58:27,846 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 88 transitions. Word has length 134 [2025-03-16 22:58:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:27,847 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 88 transitions. [2025-03-16 22:58:27,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 22:58:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 88 transitions. [2025-03-16 22:58:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:58:27,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:27,852 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:58:27,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 22:58:28,052 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-16 22:58:28,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1118474233, now seen corresponding path program 1 times [2025-03-16 22:58:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:58:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961425198] [2025-03-16 22:58:28,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:28,055 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-16 22:58:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:58:28,056 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-16 22:58:28,058 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-16 22:58:28,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:58:28,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:58:28,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:28,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:28,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 22:58:28,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:58:34,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:58:34,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:58:34,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961425198] [2025-03-16 22:58:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961425198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:58:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909734812] [2025-03-16 22:58:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:34,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:58:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:58:34,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:58:34,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:58:34,859 INFO L87 Difference]: Start difference. First operand 57 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:58:39,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:58:43,467 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-16 22:58:47,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:58:52,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:58:54,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:58:58,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:59:02,641 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-16 22:59:06,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:59:11,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:59:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:59:11,216 INFO L93 Difference]: Finished difference Result 170 states and 263 transitions. [2025-03-16 22:59:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:59:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 134 [2025-03-16 22:59:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:59:11,299 INFO L225 Difference]: With dead ends: 170 [2025-03-16 22:59:11,299 INFO L226 Difference]: Without dead ends: 114 [2025-03-16 22:59:11,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:59:11,300 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 52 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 45 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:59:11,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 245 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 36.2s Time] [2025-03-16 22:59:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-16 22:59:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2025-03-16 22:59:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:59:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2025-03-16 22:59:11,319 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 134 [2025-03-16 22:59:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:59:11,320 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2025-03-16 22:59:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:59:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2025-03-16 22:59:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 22:59:11,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:11,322 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:59:11,349 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-16 22:59:11,522 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-16 22:59:11,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:11,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash -688980230, now seen corresponding path program 1 times [2025-03-16 22:59:11,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:59:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798305944] [2025-03-16 22:59:11,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:11,524 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-16 22:59:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:59:11,526 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-16 22:59:11,527 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-16 22:59:11,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 22:59:12,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 22:59:12,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:12,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:12,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 22:59:12,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:59:15,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:59:15,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:59:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798305944] [2025-03-16 22:59:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798305944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:59:15,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:59:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:59:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479238382] [2025-03-16 22:59:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:59:15,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:59:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:59:15,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:59:15,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:59:15,904 INFO L87 Difference]: Start difference. First operand 98 states and 150 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:59:21,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:23,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:28,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:33,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:59:33,476 INFO L93 Difference]: Finished difference Result 226 states and 349 transitions. [2025-03-16 22:59:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:59:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 134 [2025-03-16 22:59:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:59:33,571 INFO L225 Difference]: With dead ends: 226 [2025-03-16 22:59:33,571 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 22:59:33,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:59:33,572 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:59:33,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 243 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 17.5s Time] [2025-03-16 22:59:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 22:59:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2025-03-16 22:59:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 22:59:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2025-03-16 22:59:33,593 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 236 transitions. Word has length 134 [2025-03-16 22:59:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:59:33,594 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 236 transitions. [2025-03-16 22:59:33,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:59:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2025-03-16 22:59:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 22:59:33,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:33,597 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:59:33,627 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-16 22:59:33,797 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-16 22:59:33,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:33,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1436958864, now seen corresponding path program 1 times [2025-03-16 22:59:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:59:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271495310] [2025-03-16 22:59:33,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:33,799 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-16 22:59:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:59:33,801 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-16 22:59:33,802 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-16 22:59:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 22:59:34,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 22:59:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:34,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:34,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 22:59:34,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:59:43,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:59:43,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:59:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271495310] [2025-03-16 22:59:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271495310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:59:43,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:59:43,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:59:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580692722] [2025-03-16 22:59:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:59:43,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:59:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:59:43,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:59:43,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:59:43,933 INFO L87 Difference]: Start difference. First operand 153 states and 236 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)