./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae9a6aa622c8554d9b66a979b5a73e2a83df40b2d25468203149fd612b870449 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:40:12,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:40:12,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:40:12,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:40:12,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:40:12,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:40:12,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:40:12,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:40:12,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:40:12,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:40:12,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:40:12,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:40:12,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:40:12,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:40:12,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:40:12,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:40:12,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:40:12,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:12,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:40:12,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:40:12,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:40:12,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae9a6aa622c8554d9b66a979b5a73e2a83df40b2d25468203149fd612b870449 [2025-03-03 19:40:13,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:40:13,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:40:13,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:40:13,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:40:13,123 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:40:13,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i [2025-03-03 19:40:14,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fc78535/4ce9cb53c22a46aab9f618256b28fb59/FLAG360eaf304 [2025-03-03 19:40:14,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:40:14,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i [2025-03-03 19:40:14,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fc78535/4ce9cb53c22a46aab9f618256b28fb59/FLAG360eaf304 [2025-03-03 19:40:14,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fc78535/4ce9cb53c22a46aab9f618256b28fb59 [2025-03-03 19:40:14,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:40:14,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:40:14,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:14,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:40:14,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:40:14,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14, skipping insertion in model container [2025-03-03 19:40:14,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:40:14,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i[915,928] [2025-03-03 19:40:14,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:14,772 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:40:14,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i[915,928] [2025-03-03 19:40:14,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:14,828 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:40:14,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14 WrapperNode [2025-03-03 19:40:14,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:14,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:14,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:40:14,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:40:14,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,876 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-03 19:40:14,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:14,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:40:14,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:40:14,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:40:14,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,893 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:40:14,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:40:14,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:40:14,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:40:14,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:40:14,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (1/1) ... [2025-03-03 19:40:14,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:14,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:40:14,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:40:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:40:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:40:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:40:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:40:14,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:40:14,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:40:15,006 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:40:15,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:40:15,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L157: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 19:40:15,246 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:40:15,246 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:40:15,258 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:40:15,258 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:40:15,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:15 BoogieIcfgContainer [2025-03-03 19:40:15,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:40:15,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:40:15,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:40:15,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:40:15,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:40:14" (1/3) ... [2025-03-03 19:40:15,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693f3a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:15, skipping insertion in model container [2025-03-03 19:40:15,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:14" (2/3) ... [2025-03-03 19:40:15,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693f3a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:15, skipping insertion in model container [2025-03-03 19:40:15,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:15" (3/3) ... [2025-03-03 19:40:15,266 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-76.i [2025-03-03 19:40:15,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:40:15,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-76.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:40:15,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:40:15,328 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;@5b625e10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:40:15,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:40:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:40:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:40:15,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:15,341 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, 1, 1, 1, 1, 1] [2025-03-03 19:40:15,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2080301457, now seen corresponding path program 1 times [2025-03-03 19:40:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:15,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-03-03 19:40:15,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:15,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:15,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:15,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 19:40:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-03-03 19:40:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108538122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:40:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218740498] [2025-03-03 19:40:15,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:15,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:15,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:40:15,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:40:15,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:15,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:15,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:40:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 19:40:15,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218740498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:15,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:40:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:40:15,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235342851] [2025-03-03 19:40:15,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:15,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:40:15,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:15,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:40:15,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:40:15,785 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:40:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:15,806 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2025-03-03 19:40:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:40:15,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 146 [2025-03-03 19:40:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:15,811 INFO L225 Difference]: With dead ends: 146 [2025-03-03 19:40:15,811 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 19:40:15,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:40:15,816 INFO L435 NwaCegarLoop]: 106 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, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:15,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 19:40:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 19:40:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:40:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2025-03-03 19:40:15,846 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 146 [2025-03-03 19:40:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:15,846 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2025-03-03 19:40:15,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:40:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2025-03-03 19:40:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:40:15,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:15,848 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, 1, 1, 1, 1, 1] [2025-03-03 19:40:15,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:16,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:40:16,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:16,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash -126102931, now seen corresponding path program 1 times [2025-03-03 19:40:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012755967] [2025-03-03 19:40:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:16,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:16,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:16,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:16,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012755967] [2025-03-03 19:40:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012755967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:40:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025943130] [2025-03-03 19:40:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:16,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:40:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:16,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:40:16,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:16,221 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:16,258 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2025-03-03 19:40:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:40:16,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 146 [2025-03-03 19:40:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:16,262 INFO L225 Difference]: With dead ends: 163 [2025-03-03 19:40:16,262 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 19:40:16,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:16,262 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:16,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 19:40:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-03-03 19:40:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:40:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2025-03-03 19:40:16,271 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 146 [2025-03-03 19:40:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:16,273 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2025-03-03 19:40:16,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2025-03-03 19:40:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:40:16,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:16,274 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, 1, 1, 1, 1, 1] [2025-03-03 19:40:16,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:40:16,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1633654740, now seen corresponding path program 1 times [2025-03-03 19:40:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161533015] [2025-03-03 19:40:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:16,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:16,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:16,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:16,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161533015] [2025-03-03 19:40:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161533015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:16,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:40:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563938507] [2025-03-03 19:40:16,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:16,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:40:16,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:16,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:40:16,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:40:16,470 INFO L87 Difference]: Start difference. First operand 83 states and 124 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:16,592 INFO L93 Difference]: Finished difference Result 243 states and 366 transitions. [2025-03-03 19:40:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:40:16,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 146 [2025-03-03 19:40:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:16,598 INFO L225 Difference]: With dead ends: 243 [2025-03-03 19:40:16,598 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 19:40:16,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:40:16,599 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 58 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:16,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 250 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:40:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 19:40:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2025-03-03 19:40:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 19:40:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 241 transitions. [2025-03-03 19:40:16,619 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 241 transitions. Word has length 146 [2025-03-03 19:40:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:16,620 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 241 transitions. [2025-03-03 19:40:16,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 241 transitions. [2025-03-03 19:40:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:40:16,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:16,623 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, 1, 1, 1, 1, 1] [2025-03-03 19:40:16,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:40:16,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:16,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 864361197, now seen corresponding path program 1 times [2025-03-03 19:40:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-03-03 19:40:16,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:40:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560553147] [2025-03-03 19:40:16,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:16,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:16,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:16,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:40:16,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:40:16,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:16,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:16,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:16,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:16,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:40:16,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:17,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:17,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-03-03 19:40:17,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:40:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560553147] [2025-03-03 19:40:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560553147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:40:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386743495] [2025-03-03 19:40:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:17,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:40:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:17,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:40:17,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:40:17,492 INFO L87 Difference]: Start difference. First operand 160 states and 241 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:18,192 INFO L93 Difference]: Finished difference Result 1013 states and 1530 transitions. [2025-03-03 19:40:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:40:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 146 [2025-03-03 19:40:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:18,197 INFO L225 Difference]: With dead ends: 1013 [2025-03-03 19:40:18,197 INFO L226 Difference]: Without dead ends: 856 [2025-03-03 19:40:18,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:40:18,199 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 492 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:18,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 715 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:40:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-03 19:40:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 547. [2025-03-03 19:40:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 385 states have (on average 1.3402597402597403) internal successors, (516), 385 states have internal predecessors, (516), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 19:40:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 824 transitions. [2025-03-03 19:40:18,283 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 824 transitions. Word has length 146 [2025-03-03 19:40:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:18,283 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 824 transitions. [2025-03-03 19:40:18,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 824 transitions. [2025-03-03 19:40:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:40:18,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:18,288 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, 1, 1, 1, 1, 1] [2025-03-03 19:40:18,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:18,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 19:40:18,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:18,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash -943093266, now seen corresponding path program 1 times [2025-03-03 19:40:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:18,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030690212] [2025-03-03 19:40:18,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:18,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:18,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:18,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:40:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937371459] [2025-03-03 19:40:18,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:18,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:40:18,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:40:18,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:40:18,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:40:18,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:18,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:40:18,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:18,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030690212] [2025-03-03 19:40:18,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:40:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937371459] [2025-03-03 19:40:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937371459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:40:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056452047] [2025-03-03 19:40:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:18,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:40:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:18,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:40:18,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:40:18,857 INFO L87 Difference]: Start difference. First operand 547 states and 824 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:19,075 INFO L93 Difference]: Finished difference Result 2150 states and 3249 transitions. [2025-03-03 19:40:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:40:19,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 146 [2025-03-03 19:40:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:19,083 INFO L225 Difference]: With dead ends: 2150 [2025-03-03 19:40:19,083 INFO L226 Difference]: Without dead ends: 1606 [2025-03-03 19:40:19,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:40:19,086 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 190 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:19,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1191 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:40:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-03 19:40:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 794. [2025-03-03 19:40:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 586 states have (on average 1.3668941979522184) internal successors, (801), 586 states have internal predecessors, (801), 198 states have call successors, (198), 9 states have call predecessors, (198), 9 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-03 19:40:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1197 transitions. [2025-03-03 19:40:19,176 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1197 transitions. Word has length 146 [2025-03-03 19:40:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1197 transitions. [2025-03-03 19:40:19,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1197 transitions. [2025-03-03 19:40:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 19:40:19,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:19,179 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, 1, 1, 1, 1, 1, 1] [2025-03-03 19:40:19,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:19,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:19,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1656753152, now seen corresponding path program 1 times [2025-03-03 19:40:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-03-03 19:40:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:19,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:40:19,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:40:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:40:19,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466467] [2025-03-03 19:40:19,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:19,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:40:19,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 19:40:19,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:40:19,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:40:19,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:19,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:19,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 19:40:19,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:20,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-03-03 19:40:20,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:40:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466467] [2025-03-03 19:40:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:40:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469329240] [2025-03-03 19:40:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:40:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:40:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:40:20,048 INFO L87 Difference]: Start difference. First operand 794 states and 1197 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:20,539 INFO L93 Difference]: Finished difference Result 1214 states and 1819 transitions. [2025-03-03 19:40:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:40:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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 147 [2025-03-03 19:40:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:20,545 INFO L225 Difference]: With dead ends: 1214 [2025-03-03 19:40:20,545 INFO L226 Difference]: Without dead ends: 1057 [2025-03-03 19:40:20,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:40:20,546 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 413 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:20,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 974 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:40:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-03 19:40:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 810. [2025-03-03 19:40:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 602 states have (on average 1.3837209302325582) internal successors, (833), 602 states have internal predecessors, (833), 198 states have call successors, (198), 9 states have call predecessors, (198), 9 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-03 19:40:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1229 transitions. [2025-03-03 19:40:20,626 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1229 transitions. Word has length 147 [2025-03-03 19:40:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1229 transitions. [2025-03-03 19:40:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1229 transitions. [2025-03-03 19:40:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 19:40:20,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:20,629 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, 1, 1, 1, 1, 1, 1] [2025-03-03 19:40:20,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 19:40:20,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:20,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:20,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1094622530, now seen corresponding path program 1 times [2025-03-03 19:40:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65335456] [2025-03-03 19:40:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:20,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:40:20,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:40:20,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:20,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:40:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217026747] [2025-03-03 19:40:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:20,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:20,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:40:20,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 19:40:20,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:40:20,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:40:20,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:20,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:40:20,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:40:21,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:40:21,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:40:21,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:21,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:40:21,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:40:21,082 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:40:21,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:40:21,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:21,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:40:21,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:40:21,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:40:21 BoogieIcfgContainer [2025-03-03 19:40:21,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:40:21,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:40:21,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:40:21,378 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:40:21,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:15" (3/4) ... [2025-03-03 19:40:21,381 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:40:21,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:40:21,383 INFO L158 Benchmark]: Toolchain (without parser) took 6809.39ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.0MB in the beginning and 101.5MB in the end (delta: 11.4MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2025-03-03 19:40:21,384 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:21,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.15ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:40:21,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.52ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:21,384 INFO L158 Benchmark]: Boogie Preprocessor took 37.24ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:21,385 INFO L158 Benchmark]: IcfgBuilder took 344.23ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 69.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:40:21,385 INFO L158 Benchmark]: TraceAbstraction took 6117.48ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 69.3MB in the beginning and 101.6MB in the end (delta: -32.3MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-03-03 19:40:21,385 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 218.1MB. Free memory was 101.6MB in the beginning and 101.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:21,387 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.43ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.15ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.52ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.24ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.23ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 69.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6117.48ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 69.3MB in the beginning and 101.6MB in the end (delta: -32.3MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 218.1MB. Free memory was 101.6MB in the beginning and 101.5MB in the end (delta: 33.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 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] double var_1_22 = 1.5; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] signed short int var_1_25 = 10; [L42] signed short int var_1_26 = -10; [L43] float var_1_27 = 3.5; [L44] signed short int var_1_28 = -4; [L45] double var_1_29 = 31.5; [L46] unsigned short int var_1_30 = 32; [L47] unsigned short int var_1_31 = 100; [L48] double var_1_32 = 10000000000000.25; [L49] double last_1_var_1_1 = 256.5; [L50] float last_1_var_1_8 = 5.25; [L51] signed long int last_1_var_1_11 = 4; [L52] unsigned short int last_1_var_1_14 = 10000; [L53] unsigned short int last_1_var_1_17 = 4; [L54] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L149] last_1_var_1_1 = var_1_1 [L150] last_1_var_1_8 = var_1_8 [L151] last_1_var_1_11 = var_1_11 [L152] last_1_var_1_14 = var_1_14 [L153] last_1_var_1_17 = var_1_17 [L154] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L112] var_1_2 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L113] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L114] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L114] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L115] var_1_3 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L116] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L117] var_1_4 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L118] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L119] var_1_5 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L120] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L121] var_1_7 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L122] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L123] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L123] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L124] var_1_16 = __VERIFIER_nondet_ushort() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L126] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L126] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L127] var_1_19 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L128] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L129] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L129] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L132] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L132] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L133] var_1_22 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L134] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L135] var_1_24 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L136] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L137] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L137] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-10, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L138] var_1_26 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_26 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L139] RET assume_abort_if_not(var_1_26 >= -32767) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L140] CALL assume_abort_if_not(var_1_26 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L140] RET assume_abort_if_not(var_1_26 <= 32766) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=-4, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L141] var_1_28 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_28 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_28 >= -32767) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L143] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L143] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=100, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L144] var_1_31 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L145] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L146] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=0, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=0, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L146] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=10, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=0, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L165] RET updateVariables() [L166] CALL step() [L58] var_1_21 = var_1_22 [L59] var_1_23 = var_1_24 [L60] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=7/2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=0, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L61] COND TRUE var_1_26 <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) [L62] var_1_27 = var_1_22 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=63/2, var_1_2=0, var_1_30=32, var_1_31=0, var_1_32=40000000000001/4, var_1_6=-64, var_1_8=21/4] [L64] var_1_29 = var_1_22 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_22 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_6=-64, var_1_8=21/4] [L67] COND FALSE !(\read(var_1_2)) [L76] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_6=-64, var_1_8=21/4] [L78] COND TRUE ! var_1_2 [L79] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L83] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L88] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L89] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L89] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L92] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L99] COND TRUE var_1_4 <= last_1_var_1_1 [L100] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L104] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L105] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L106] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L166] RET step() [L167] CALL, EXPR property() [L157] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L157-L158] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=-32767, var_1_26=-32767, var_1_27=2, var_1_28=0, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_3=3, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1185 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1185 mSDsluCounter, 3430 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2274 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1423 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 1156 mSDtfsCounter, 1423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1383 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1016 ConstructedInterpolants, 0 QuantifiedInterpolants, 3984 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1476 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 6426/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:40:21,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae9a6aa622c8554d9b66a979b5a73e2a83df40b2d25468203149fd612b870449 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:40:23,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:40:23,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:40:23,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:40:23,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:40:23,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:40:23,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:40:23,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:40:23,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:40:23,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:40:23,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:40:23,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:40:23,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:40:23,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:40:23,331 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:40:23,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:40:23,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:40:23,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:40:23,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:40:23,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:40:23,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:40:23,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:40:23,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:40:23,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:40:23,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:23,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:40:23,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:40:23,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:40:23,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:40:23,335 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae9a6aa622c8554d9b66a979b5a73e2a83df40b2d25468203149fd612b870449 [2025-03-03 19:40:23,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:40:23,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:40:23,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:40:23,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:40:23,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:40:23,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i [2025-03-03 19:40:24,726 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef933225f/510bc859a8a64daa9e08e15ab907c7ef/FLAG3c69d7340 [2025-03-03 19:40:24,940 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:40:24,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i [2025-03-03 19:40:24,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef933225f/510bc859a8a64daa9e08e15ab907c7ef/FLAG3c69d7340 [2025-03-03 19:40:24,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef933225f/510bc859a8a64daa9e08e15ab907c7ef [2025-03-03 19:40:24,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:40:24,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:40:24,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:24,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:40:24,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:40:24,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:24" (1/1) ... [2025-03-03 19:40:24,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f099a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:24, skipping insertion in model container [2025-03-03 19:40:24,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:24" (1/1) ... [2025-03-03 19:40:24,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:40:25,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i[915,928] [2025-03-03 19:40:25,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:25,118 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:40:25,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-76.i[915,928] [2025-03-03 19:40:25,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:25,156 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:40:25,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25 WrapperNode [2025-03-03 19:40:25,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:25,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:25,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:40:25,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:40:25,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,192 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-03-03 19:40:25,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:25,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:40:25,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:40:25,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:40:25,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:40:25,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:40:25,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:40:25,233 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:40:25,233 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:40:25,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (1/1) ... [2025-03-03 19:40:25,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:25,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:25,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:40:25,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:40:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:40:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:40:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:40:25,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:40:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:40:25,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:40:25,344 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:40:25,346 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:40:35,180 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 19:40:35,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:40:35,191 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:40:35,191 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:40:35,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:35 BoogieIcfgContainer [2025-03-03 19:40:35,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:40:35,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:40:35,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:40:35,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:40:35,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:40:24" (1/3) ... [2025-03-03 19:40:35,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1b5ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:35, skipping insertion in model container [2025-03-03 19:40:35,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:25" (2/3) ... [2025-03-03 19:40:35,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1b5ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:35, skipping insertion in model container [2025-03-03 19:40:35,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:35" (3/3) ... [2025-03-03 19:40:35,199 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-76.i [2025-03-03 19:40:35,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:40:35,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-76.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:40:35,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:40:35,272 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;@1d1c6d05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:40:35,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:40:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:40:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 19:40:35,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:35,286 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, 1, 1] [2025-03-03 19:40:35,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:35,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1442168721, now seen corresponding path program 1 times [2025-03-03 19:40:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:40:35,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302467072] [2025-03-03 19:40:35,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:40:35,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:40:35,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:40:35,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:40:35,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 19:40:36,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 19:40:36,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:36,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:36,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:40:36,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-03 19:40:36,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:36,136 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:40:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302467072] [2025-03-03 19:40:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302467072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:40:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003830744] [2025-03-03 19:40:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:40:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:40:36,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:40:36,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:40:36,157 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:40:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:36,179 INFO L93 Difference]: Finished difference Result 132 states and 227 transitions. [2025-03-03 19:40:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:40:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 143 [2025-03-03 19:40:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:36,187 INFO L225 Difference]: With dead ends: 132 [2025-03-03 19:40:36,187 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 19:40:36,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:40:36,193 INFO L435 NwaCegarLoop]: 100 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, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:36,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 19:40:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-03 19:40:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:40:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2025-03-03 19:40:36,233 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 100 transitions. Word has length 143 [2025-03-03 19:40:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:36,233 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 100 transitions. [2025-03-03 19:40:36,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:40:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 100 transitions. [2025-03-03 19:40:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 19:40:36,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:36,238 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, 1, 1] [2025-03-03 19:40:36,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:36,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:40:36,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash -646063051, now seen corresponding path program 1 times [2025-03-03 19:40:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:40:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334364085] [2025-03-03 19:40:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:36,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:40:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:40:36,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:40:36,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:40:36,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 19:40:37,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 19:40:37,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:37,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:37,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:40:37,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:39,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:39,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:40:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334364085] [2025-03-03 19:40:39,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334364085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:39,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:40:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221307736] [2025-03-03 19:40:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:39,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:40:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:40:39,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:40:39,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:39,908 INFO L87 Difference]: Start difference. First operand 66 states and 100 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:44,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:40:48,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:40:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:48,184 INFO L93 Difference]: Finished difference Result 192 states and 294 transitions. [2025-03-03 19:40:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:40:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 143 [2025-03-03 19:40:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:48,266 INFO L225 Difference]: With dead ends: 192 [2025-03-03 19:40:48,266 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 19:40:48,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:48,267 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:48,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-03 19:40:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 19:40:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-03 19:40:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 19:40:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2025-03-03 19:40:48,285 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 143 [2025-03-03 19:40:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:48,288 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2025-03-03 19:40:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:40:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2025-03-03 19:40:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 19:40:48,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:48,290 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, 1, 1] [2025-03-03 19:40:48,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:40:48,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:40:48,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:48,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:48,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1841449782, now seen corresponding path program 1 times [2025-03-03 19:40:48,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:40:48,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172559438] [2025-03-03 19:40:48,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:48,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:40:48,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:40:48,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:40:48,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:40:48,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 19:40:49,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 19:40:49,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:49,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:49,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:40:49,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:40:58,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:58,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:40:58,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172559438] [2025-03-03 19:40:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172559438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:58,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:40:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124145290] [2025-03-03 19:40:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:58,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:40:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:40:58,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:40:58,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:40:58,008 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:05,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:09,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:13,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:17,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:21,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:24,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:29,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:31,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:41,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:45,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:49,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:50,140 INFO L93 Difference]: Finished difference Result 788 states and 1211 transitions. [2025-03-03 19:41:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:41:50,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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 143 [2025-03-03 19:41:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:50,148 INFO L225 Difference]: With dead ends: 788 [2025-03-03 19:41:50,148 INFO L226 Difference]: Without dead ends: 664 [2025-03-03 19:41:50,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:41:50,150 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 429 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 185 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:50,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 638 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 591 Invalid, 9 Unknown, 0 Unchecked, 50.7s Time] [2025-03-03 19:41:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-03 19:41:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 433. [2025-03-03 19:41:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 271 states have (on average 1.3321033210332103) internal successors, (361), 271 states have internal predecessors, (361), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 19:41:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2025-03-03 19:41:50,231 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 143 [2025-03-03 19:41:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:50,231 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2025-03-03 19:41:50,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2025-03-03 19:41:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 19:41:50,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:50,233 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, 1, 1] [2025-03-03 19:41:50,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:41:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:41:50,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:50,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1566013833, now seen corresponding path program 1 times [2025-03-03 19:41:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:41:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500166140] [2025-03-03 19:41:50,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:50,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:41:50,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:41:50,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:41:50,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:41:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 19:41:51,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 19:41:51,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:51,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:51,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:41:51,139 INFO L279 TraceCheckSpWp]: Computing forward predicates...