./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 971c3c41652faa6763f696423d617342190d331658e9b3a0d06a1ab8241c9b75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:20:15,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:20:15,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:20:15,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:20:15,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:20:15,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:20:15,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:20:15,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:20:15,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:20:15,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:20:15,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:20:15,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:20:15,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:20:15,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:20:15,974 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:20:15,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:20:15,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:20:15,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:20:15,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:20:15,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:20:15,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:20:15,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:20:15,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:20:15,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:20:15,977 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-jdk21/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 -> 971c3c41652faa6763f696423d617342190d331658e9b3a0d06a1ab8241c9b75 [2025-01-09 12:20:16,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:20:16,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:20:16,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:20:16,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:20:16,198 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:20:16,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i [2025-01-09 12:20:17,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0dabddcc/23b3333ec61e41dfa3f42d33fd926312/FLAGcac94a645 [2025-01-09 12:20:17,565 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:20:17,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i [2025-01-09 12:20:17,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0dabddcc/23b3333ec61e41dfa3f42d33fd926312/FLAGcac94a645 [2025-01-09 12:20:17,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0dabddcc/23b3333ec61e41dfa3f42d33fd926312 [2025-01-09 12:20:17,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:20:17,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:20:17,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:20:17,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:20:17,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:20:17,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bd6721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17, skipping insertion in model container [2025-01-09 12:20:17,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:20:17,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i[913,926] [2025-01-09 12:20:17,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:20:17,788 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:20:17,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i[913,926] [2025-01-09 12:20:17,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:20:17,841 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:20:17,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17 WrapperNode [2025-01-09 12:20:17,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:20:17,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:20:17,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:20:17,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:20:17,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,877 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-01-09 12:20:17,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:20:17,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:20:17,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:20:17,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:20:17,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,896 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-01-09 12:20:17,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:20:17,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:20:17,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:20:17,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:20:17,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (1/1) ... [2025-01-09 12:20:17,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:20:17,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:20:17,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:20:17,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:20:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:20:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:20:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:20:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:20:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:20:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:20:18,027 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:20:18,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:20:18,209 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:20:18,210 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:20:18,217 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:20:18,218 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:20:18,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:18 BoogieIcfgContainer [2025-01-09 12:20:18,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:20:18,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:20:18,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:20:18,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:20:18,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:20:17" (1/3) ... [2025-01-09 12:20:18,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceee93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:18, skipping insertion in model container [2025-01-09 12:20:18,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:17" (2/3) ... [2025-01-09 12:20:18,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceee93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:18, skipping insertion in model container [2025-01-09 12:20:18,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:18" (3/3) ... [2025-01-09 12:20:18,224 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-60.i [2025-01-09 12:20:18,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:20:18,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-60.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:20:18,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:20:18,290 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;@1e818ebc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:20:18,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:20:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 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-01-09 12:20:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:20:18,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:20:18,305 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, 1, 1, 1, 1] [2025-01-09 12:20:18,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:20:18,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:20:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1846114263, now seen corresponding path program 1 times [2025-01-09 12:20:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:20:18,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827113957] [2025-01-09 12:20:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:20:18,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:20:18,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:20:18,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:20:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:20:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:20:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827113957] [2025-01-09 12:20:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827113957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:20:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184334558] [2025-01-09 12:20:18,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:20:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:20:18,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:20:18,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:20:18,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:20:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:20:18,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:18,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:20:18,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:20:18,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:20:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:20:18,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:20:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184334558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:20:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:20:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:20:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608037147] [2025-01-09 12:20:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:20:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:20:18,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:20:18,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:20:18,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:20:18,761 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-01-09 12:20:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:20:18,780 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2025-01-09 12:20:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:20:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 139 [2025-01-09 12:20:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:20:18,789 INFO L225 Difference]: With dead ends: 124 [2025-01-09 12:20:18,789 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:20:18,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-01-09 12:20:18,793 INFO L435 NwaCegarLoop]: 93 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, 93 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-01-09 12:20:18,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:20:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:20:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 12:20:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 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-01-09 12:20:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-01-09 12:20:18,824 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 139 [2025-01-09 12:20:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:20:18,824 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-01-09 12:20:18,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-01-09 12:20:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-01-09 12:20:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:20:18,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:20:18,827 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, 1, 1, 1, 1] [2025-01-09 12:20:18,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:20:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:20:19,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:20:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:20:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1279937295, now seen corresponding path program 1 times [2025-01-09 12:20:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:20:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271762043] [2025-01-09 12:20:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:20:19,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:20:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:20:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:20:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:20:19,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:20:19,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271762043] [2025-01-09 12:20:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271762043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:20:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:20:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:20:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186760985] [2025-01-09 12:20:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:20:19,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:20:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:20:19,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:20:19,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:20:19,222 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-01-09 12:20:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:20:19,248 INFO L93 Difference]: Finished difference Result 156 states and 234 transitions. [2025-01-09 12:20:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:20:19,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 139 [2025-01-09 12:20:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:20:19,250 INFO L225 Difference]: With dead ends: 156 [2025-01-09 12:20:19,250 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 12:20:19,251 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-01-09 12:20:19,251 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 50 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 224 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-01-09 12:20:19,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 224 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:20:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 12:20:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2025-01-09 12:20:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.280701754385965) internal successors, (73), 58 states have internal predecessors, (73), 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-01-09 12:20:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2025-01-09 12:20:19,274 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 139 [2025-01-09 12:20:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:20:19,274 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2025-01-09 12:20:19,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-01-09 12:20:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2025-01-09 12:20:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:20:19,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:20:19,276 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, 1, 1, 1, 1, 1] [2025-01-09 12:20:19,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:20:19,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:20:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:20:19,277 INFO L85 PathProgramCache]: Analyzing trace with hash -230466846, now seen corresponding path program 1 times [2025-01-09 12:20:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:20:19,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735490975] [2025-01-09 12:20:19,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:20:19,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:20:19,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:20:19,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:19,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:20:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:20:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:20:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735490975] [2025-01-09 12:20:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735490975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:20:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:20:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:20:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99605623] [2025-01-09 12:20:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:20:19,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:20:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:20:19,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:20:19,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:20:19,401 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-01-09 12:20:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:20:19,434 INFO L93 Difference]: Finished difference Result 207 states and 309 transitions. [2025-01-09 12:20:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:20:19,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 140 [2025-01-09 12:20:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:20:19,436 INFO L225 Difference]: With dead ends: 207 [2025-01-09 12:20:19,437 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 12:20:19,437 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-01-09 12:20:19,438 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:20:19,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 175 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:20:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 12:20:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2025-01-09 12:20:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 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-01-09 12:20:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2025-01-09 12:20:19,456 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 140 [2025-01-09 12:20:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:20:19,457 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2025-01-09 12:20:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-01-09 12:20:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2025-01-09 12:20:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:20:19,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:20:19,458 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, 1, 1, 1, 1, 1] [2025-01-09 12:20:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:20:19,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:20:19,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:20:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1039813472, now seen corresponding path program 1 times [2025-01-09 12:20:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:20:19,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253178017] [2025-01-09 12:20:19,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:20:19,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:20:19,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:20:19,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:20:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858162790] [2025-01-09 12:20:19,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:19,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:20:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:20:19,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:20:19,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:20:19,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:20:19,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:20:19,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:19,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:20:19,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:20:19,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:20:19,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:20:19,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:19,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:20:19,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:20:19,810 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:20:19,810 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:20:19,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:20:20,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:20:20,015 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 12:20:20,084 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:20:20,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:20:20 BoogieIcfgContainer [2025-01-09 12:20:20,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:20:20,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:20:20,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:20:20,088 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:20:20,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:18" (3/4) ... [2025-01-09 12:20:20,091 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:20:20,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:20:20,092 INFO L158 Benchmark]: Toolchain (without parser) took 2493.96ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 72.1MB in the end (delta: 40.3MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2025-01-09 12:20:20,093 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:20:20,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.80ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.4MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:20:20,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.90ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:20:20,094 INFO L158 Benchmark]: Boogie Preprocessor took 27.87ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:20:20,094 INFO L158 Benchmark]: RCFGBuilder took 311.47ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 73.6MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:20:20,094 INFO L158 Benchmark]: TraceAbstraction took 1867.98ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 72.2MB in the end (delta: 991.0kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2025-01-09 12:20:20,094 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:20:20,095 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.80ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.4MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.90ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.87ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 311.47ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 73.6MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1867.98ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 72.2MB in the end (delta: 991.0kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 124. 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; VAL [isInitial=0, 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=1, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L145] isInitial = 1 [L146] FCALL initially() [L148] CALL updateLastVariables() [L134] last_1_var_1_1 = var_1_1 [L135] last_1_var_1_9 = var_1_9 [L136] last_1_var_1_11 = var_1_11 [L137] last_1_var_1_16 = var_1_16 [L138] last_1_var_1_20 = 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=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=1, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L148] RET updateLastVariables() [L149] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] 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] [L98] 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] [L99] 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] [L99] 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] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] 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] [L101] 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] [L102] 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] [L102] 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] [L103] var_1_6 = __VERIFIER_nondet_short() [L104] 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] [L104] 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] [L105] 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] [L105] 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] [L106] var_1_7 = __VERIFIER_nondet_short() [L107] 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=32, 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=32, var_1_8=1283/5, var_1_9=50] [L107] 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=32, var_1_8=1283/5, var_1_9=50] [L108] 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=32, 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=32, var_1_8=1283/5, var_1_9=50] [L108] 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=32, var_1_8=1283/5, var_1_9=50] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] 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=32, 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=32, var_1_8=1283/5, var_1_9=50] [L110] 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=32, var_1_8=1283/5, var_1_9=50] [L111] 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=129, 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=32, 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L111] 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L112] var_1_12 = __VERIFIER_nondet_uchar() [L113] 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=129, 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=32, 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L113] 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L114] 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=129, 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=32, 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L114] 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L115] var_1_13 = __VERIFIER_nondet_uchar() [L116] 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=129, var_1_11=511/4, var_1_12=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=32, 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=129, var_1_11=511/4, var_1_12=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=32, var_1_8=1283/5, var_1_9=50] [L116] 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=129, var_1_11=511/4, var_1_12=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=32, var_1_8=1283/5, var_1_9=50] [L117] 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=129, 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=32, 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L117] 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=129, 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=32, var_1_8=1283/5, var_1_9=50] [L118] var_1_14 = __VERIFIER_nondet_uchar() [L119] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, 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=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, 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=32, var_1_8=1283/5, var_1_9=50] [L119] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, 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=32, var_1_8=1283/5, var_1_9=50] [L120] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L120] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L121] var_1_15 = __VERIFIER_nondet_double() [L122] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L122] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L124] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L126] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L128] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, 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=32, var_1_8=1283/5, var_1_9=50] [L129] var_1_21 = __VERIFIER_nondet_ulong() [L130] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L130] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L131] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L131] 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=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L149] RET updateVariables() [L150] CALL step() [L49] signed long int stepLocal_0 = (((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_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, stepLocal_0=32, var_1_10=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=50] [L50] COND FALSE !(last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) [L57] 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, stepLocal_0=32, var_1_10=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L59] unsigned long int stepLocal_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, stepLocal_0=32, stepLocal_1=10000000, var_1_10=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L60] COND FALSE !(((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > stepLocal_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, stepLocal_0=32, var_1_10=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L63] COND TRUE (last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) 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, stepLocal_0=32, var_1_10=129, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L64] COND FALSE !(\read(var_1_2)) [L67] 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, stepLocal_0=32, var_1_10=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L72] COND TRUE \read(var_1_13) [L73] var_1_20 = (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + 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, stepLocal_0=32, var_1_10=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=258, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L81] 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, stepLocal_0=32, var_1_10=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=258, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L86] COND FALSE !(\read(var_1_2)) [L93] 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, stepLocal_0=32, var_1_10=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=258, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] 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)))) ; VAL [\result=0, 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=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=258, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [L151] RET, EXPR property() [L151] 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=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=258, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] [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=129, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_15=2, var_1_16=513/2, var_1_1=129, var_1_20=258, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=32, var_1_8=1283/5, var_1_9=129] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 492 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 331 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 837 NumberOfCodeBlocks, 837 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 553 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3654/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-01-09 12:20:20,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 971c3c41652faa6763f696423d617342190d331658e9b3a0d06a1ab8241c9b75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:20:22,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:20:22,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:20:22,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:20:22,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:20:22,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:20:22,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:20:22,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:20:22,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:20:22,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:20:22,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:20:22,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:20:22,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:20:22,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:20:22,222 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:20:22,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:20:22,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:20:22,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:20:22,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:20:22,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:20:22,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:20:22,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:20:22,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:20:22,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:20:22,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:20:22,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:20:22,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:20:22,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:20:22,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:20:22,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:20:22,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:20:22,226 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:20:22,226 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:20:22,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:20:22,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:20:22,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:20:22,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:20:22,227 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-jdk21/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 -> 971c3c41652faa6763f696423d617342190d331658e9b3a0d06a1ab8241c9b75 [2025-01-09 12:20:22,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:20:22,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:20:22,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:20:22,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:20:22,488 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:20:22,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i [2025-01-09 12:20:23,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fa89eb38/f5ca314b22ee4fc39510a6b6042a481d/FLAGb90e00167 [2025-01-09 12:20:23,825 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:20:23,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i [2025-01-09 12:20:23,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fa89eb38/f5ca314b22ee4fc39510a6b6042a481d/FLAGb90e00167 [2025-01-09 12:20:24,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fa89eb38/f5ca314b22ee4fc39510a6b6042a481d [2025-01-09 12:20:24,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:20:24,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:20:24,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:20:24,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:20:24,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:20:24,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f786a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24, skipping insertion in model container [2025-01-09 12:20:24,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:20:24,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i[913,926] [2025-01-09 12:20:24,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:20:24,348 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:20:24,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-60.i[913,926] [2025-01-09 12:20:24,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:20:24,380 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:20:24,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24 WrapperNode [2025-01-09 12:20:24,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:20:24,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:20:24,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:20:24,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:20:24,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,414 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-01-09 12:20:24,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:20:24,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:20:24,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:20:24,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:20:24,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,448 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-01-09 12:20:24,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:20:24,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:20:24,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:20:24,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:20:24,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (1/1) ... [2025-01-09 12:20:24,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:20:24,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:20:24,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:20:24,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:20:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:20:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:20:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:20:24,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:20:24,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:20:24,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:20:24,581 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:20:24,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:20:37,870 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:20:37,870 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:20:37,880 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:20:37,881 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:20:37,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:37 BoogieIcfgContainer [2025-01-09 12:20:37,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:20:37,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:20:37,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:20:37,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:20:37,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:20:24" (1/3) ... [2025-01-09 12:20:37,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410098a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:37, skipping insertion in model container [2025-01-09 12:20:37,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:24" (2/3) ... [2025-01-09 12:20:37,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410098a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:37, skipping insertion in model container [2025-01-09 12:20:37,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:37" (3/3) ... [2025-01-09 12:20:37,888 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-60.i [2025-01-09 12:20:37,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:20:37,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-60.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:20:37,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:20:37,956 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@138fb8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:20:37,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:20:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 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-01-09 12:20:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:20:37,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:20:37,967 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, 1, 1, 1, 1] [2025-01-09 12:20:37,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:20:37,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:20:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1846114263, now seen corresponding path program 1 times [2025-01-09 12:20:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:20:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702415468] [2025-01-09 12:20:37,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:37,979 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-01-09 12:20:37,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:20:37,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 12:20:37,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:20:38,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:20:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:20:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:20:38,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:20:38,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:20:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 12:20:38,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:20:38,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:20:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702415468] [2025-01-09 12:20:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702415468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:20:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:20:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:20:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058468977] [2025-01-09 12:20:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:20:38,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:20:38,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:20:38,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:20:38,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:20:38,944 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-01-09 12:20:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:20:38,958 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2025-01-09 12:20:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:20:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 139 [2025-01-09 12:20:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:20:38,966 INFO L225 Difference]: With dead ends: 124 [2025-01-09 12:20:38,966 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:20:38,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-01-09 12:20:38,973 INFO L435 NwaCegarLoop]: 93 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, 93 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-01-09 12:20:38,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:20:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:20:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 12:20:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 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-01-09 12:20:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-01-09 12:20:39,024 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 139 [2025-01-09 12:20:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:20:39,028 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-01-09 12:20:39,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-01-09 12:20:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-01-09 12:20:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:20:39,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:20:39,030 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, 1, 1, 1, 1] [2025-01-09 12:20:39,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:20:39,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 12:20:39,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:20:39,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:20:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1279937295, now seen corresponding path program 1 times [2025-01-09 12:20:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:20:39,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326355953] [2025-01-09 12:20:39,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:20:39,234 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-01-09 12:20:39,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:20:39,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 12:20:39,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:20:39,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:20:40,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:20:40,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:20:40,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:20:40,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:20:40,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:20:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:20:49,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:20:49,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:20:49,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326355953] [2025-01-09 12:20:49,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326355953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:20:49,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:20:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:20:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714669757] [2025-01-09 12:20:49,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:20:49,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:20:49,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:20:49,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:20:49,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:20:49,452 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-01-09 12:20:55,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:20:59,314 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-01-09 12:21:03,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:07,568 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-01-09 12:21:11,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:15,861 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-01-09 12:21:17,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:22,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:26,355 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-01-09 12:21:30,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:34,627 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-01-09 12:21:38,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:42,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:42,956 INFO L93 Difference]: Finished difference Result 183 states and 278 transitions. [2025-01-09 12:21:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:21:43,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 139 [2025-01-09 12:21:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:43,054 INFO L225 Difference]: With dead ends: 183 [2025-01-09 12:21:43,054 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 12:21:43,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:21:43,055 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 55 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 47 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:21:43,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 222 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 45 Invalid, 12 Unknown, 0 Unchecked, 53.3s Time] [2025-01-09 12:21:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 12:21:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2025-01-09 12:21:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 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-01-09 12:21:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 162 transitions. [2025-01-09 12:21:43,094 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 162 transitions. Word has length 139 [2025-01-09 12:21:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 162 transitions. [2025-01-09 12:21:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-01-09 12:21:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 162 transitions. [2025-01-09 12:21:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:21:43,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:43,096 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, 1, 1, 1, 1, 1, 1] [2025-01-09 12:21:43,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 12:21:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 12:21:43,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:43,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1926138734, now seen corresponding path program 1 times [2025-01-09 12:21:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:21:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405800807] [2025-01-09 12:21:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:43,298 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-01-09 12:21:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:21:43,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 12:21:43,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:21:43,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:21:44,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:21:44,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:44,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:44,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:21:44,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:21:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:21:44,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:21:44,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:21:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405800807] [2025-01-09 12:21:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405800807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:21:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:21:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:21:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081524574] [2025-01-09 12:21:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:21:44,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:21:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:21:44,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:21:44,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:21:44,311 INFO L87 Difference]: Start difference. First operand 108 states and 162 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-01-09 12:21:48,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:21:52,843 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-01-09 12:21:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:21:52,953 INFO L93 Difference]: Finished difference Result 180 states and 269 transitions. [2025-01-09 12:21:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:21:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 141 [2025-01-09 12:21:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:21:52,955 INFO L225 Difference]: With dead ends: 180 [2025-01-09 12:21:52,955 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 12:21:52,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 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-01-09 12:21:52,956 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:21:52,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 12:21:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 12:21:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2025-01-09 12:21:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 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-01-09 12:21:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-01-09 12:21:52,976 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 141 [2025-01-09 12:21:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:21:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-01-09 12:21:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-01-09 12:21:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-01-09 12:21:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:21:52,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:21:52,982 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, 1, 1, 1, 1, 1, 1] [2025-01-09 12:21:53,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 12:21:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 12:21:53,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:21:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:21:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1559481936, now seen corresponding path program 1 times [2025-01-09 12:21:53,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:21:53,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075846482] [2025-01-09 12:21:53,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:21:53,186 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-01-09 12:21:53,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:21:53,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 12:21:53,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:21:53,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:21:54,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:21:54,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:21:54,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:21:54,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 12:21:54,127 INFO L279 TraceCheckSpWp]: Computing forward predicates...