./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.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 bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:00:22,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:00:22,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:00:22,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:00:22,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:00:22,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:00:22,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:00:22,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:00:22,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:00:22,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:00:22,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:00:22,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:00:22,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:00:22,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:00:22,529 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:00:22,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:00:22,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:00:22,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:00:22,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:00:22,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:00:22,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:00:22,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:00:22,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:00:22,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:00:22,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:00:22,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:00:22,532 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 -> bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 [2025-03-08 16:00:22,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:00:22,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:00:22,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:00:22,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:00:22,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:00:22,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2025-03-08 16:00:23,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2678e0c/3aa4a9a49a5b472faa42bbc4861439cc/FLAGafbeee92f [2025-03-08 16:00:24,269 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:00:24,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2025-03-08 16:00:24,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2678e0c/3aa4a9a49a5b472faa42bbc4861439cc/FLAGafbeee92f [2025-03-08 16:00:24,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2678e0c/3aa4a9a49a5b472faa42bbc4861439cc [2025-03-08 16:00:24,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:00:24,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:00:24,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:00:24,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:00:24,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:00:24,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1396f29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24, skipping insertion in model container [2025-03-08 16:00:24,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:00:24,677 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_operatoramount_amount50_file-91.i[915,928] [2025-03-08 16:00:24,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:00:24,726 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:00:24,737 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_operatoramount_amount50_file-91.i[915,928] [2025-03-08 16:00:24,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:00:24,766 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:00:24,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24 WrapperNode [2025-03-08 16:00:24,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:00:24,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:00:24,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:00:24,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:00:24,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,801 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-08 16:00:24,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:00:24,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:00:24,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:00:24,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:00:24,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:00:24,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:00:24,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:00:24,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:00:24,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:00:24,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (1/1) ... [2025-03-08 16:00:24,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:00:24,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:00:24,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:00:24,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:00:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:00:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:00:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:00:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:00:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:00:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:00:24,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:00:24,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:00:25,188 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 16:00:25,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:00:25,195 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:00:25,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:00:25,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:25 BoogieIcfgContainer [2025-03-08 16:00:25,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:00:25,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:00:25,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:00:25,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:00:25,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:00:24" (1/3) ... [2025-03-08 16:00:25,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb8e1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:00:25, skipping insertion in model container [2025-03-08 16:00:25,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:24" (2/3) ... [2025-03-08 16:00:25,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb8e1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:00:25, skipping insertion in model container [2025-03-08 16:00:25,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:25" (3/3) ... [2025-03-08 16:00:25,204 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-91.i [2025-03-08 16:00:25,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:00:25,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-91.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:00:25,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:00:25,266 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;@6be66c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:00:25,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:00:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:00:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:00:25,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:25,280 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:25,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:25,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1517056270, now seen corresponding path program 1 times [2025-03-08 16:00:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585387895] [2025-03-08 16:00:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:25,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:00:25,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:00:25,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:25,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 16:00:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585387895] [2025-03-08 16:00:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585387895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:00:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116260863] [2025-03-08 16:00:25,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:00:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:00:25,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:00:25,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:00:25,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:00:25,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:00:25,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:25,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:25,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:00:25,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:00:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 16:00:25,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:00:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116260863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:00:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:00:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273918740] [2025-03-08 16:00:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:00:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:25,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:00:25,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:00:25,683 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:00:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:25,704 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-03-08 16:00:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:00:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-08 16:00:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:25,712 INFO L225 Difference]: With dead ends: 118 [2025-03-08 16:00:25,713 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 16:00:25,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:00:25,718 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:25,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:00:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 16:00:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 16:00:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:00:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-03-08 16:00:25,749 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 129 [2025-03-08 16:00:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:25,749 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-03-08 16:00:25,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:00:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-03-08 16:00:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:00:25,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:25,758 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:25,765 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-08 16:00:25,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:00:25,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:25,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1379337296, now seen corresponding path program 1 times [2025-03-08 16:00:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112879315] [2025-03-08 16:00:25,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:25,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:00:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:00:26,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:26,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:00:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112879315] [2025-03-08 16:00:26,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112879315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:26,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:26,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:00:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484476746] [2025-03-08 16:00:26,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:26,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:00:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:26,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:00:26,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:00:26,185 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:00:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:26,227 INFO L93 Difference]: Finished difference Result 167 states and 250 transitions. [2025-03-08 16:00:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:00:26,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-08 16:00:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:26,231 INFO L225 Difference]: With dead ends: 167 [2025-03-08 16:00:26,232 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:00:26,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:00:26,233 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:26,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 231 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:00:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:00:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 61. [2025-03-08 16:00:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:00:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2025-03-08 16:00:26,246 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 129 [2025-03-08 16:00:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2025-03-08 16:00:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:00:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2025-03-08 16:00:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 16:00:26,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:26,249 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:00:26,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -102420748, now seen corresponding path program 1 times [2025-03-08 16:00:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2889240] [2025-03-08 16:00:26,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:26,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 16:00:26,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 16:00:26,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:26,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:00:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480179084] [2025-03-08 16:00:26,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:26,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:00:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:00:26,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:00:26,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:00:26,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 16:00:26,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 16:00:26,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:26,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:00:26,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:00:26,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 16:00:26,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 16:00:26,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:26,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:00:26,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:00:26,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:00:26,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:00:26,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:00:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 16:00:26,829 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 16:00:26,898 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:00:26,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:00:26 BoogieIcfgContainer [2025-03-08 16:00:26,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:00:26,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:00:26,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:00:26,902 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:00:26,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:25" (3/4) ... [2025-03-08 16:00:26,904 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:00:26,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:00:26,905 INFO L158 Benchmark]: Toolchain (without parser) took 2344.03ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 88.9MB in the end (delta: 24.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-03-08 16:00:26,905 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:00:26,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.26ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:00:26,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 95.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:00:26,907 INFO L158 Benchmark]: Boogie Preprocessor took 42.90ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 88.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:00:26,908 INFO L158 Benchmark]: IcfgBuilder took 350.82ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 66.8MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:00:26,908 INFO L158 Benchmark]: TraceAbstraction took 1703.31ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 88.9MB in the end (delta: -22.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:00:26,908 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 142.6MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:00:26,909 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.22ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.26ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 95.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.90ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 88.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 350.82ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 66.8MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1703.31ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 88.9MB in the end (delta: -22.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 142.6MB. Free memory is still 88.9MB. 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 117, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -64; [L23] signed short int var_1_5 = 8; [L24] signed short int var_1_6 = 8; [L25] signed short int var_1_7 = 5; [L26] signed short int var_1_8 = 0; [L27] signed char var_1_9 = 5; [L28] signed char var_1_11 = 16; [L29] signed short int var_1_12 = 25; [L30] signed short int var_1_13 = 64; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L33] float var_1_17 = 1.2; [L34] float var_1_18 = 5.8; [L35] float var_1_19 = 10.25; [L36] float var_1_20 = 2.5; [L37] signed short int var_1_21 = 200; [L38] unsigned char var_1_24 = 1; [L39] unsigned char var_1_25 = 0; [L40] signed char var_1_26 = -5; [L41] signed short int last_1_var_1_1 = -64; [L42] signed short int last_1_var_1_13 = 64; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_26 = -5; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_15 = var_1_15 [L130] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L94] var_1_5 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L97] var_1_6 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L98] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L100] var_1_7 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L103] var_1_8 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L109] var_1_12 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] var_1_16 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] var_1_18 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L117] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L120] var_1_20 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L121] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L141] RET updateVariables() [L142] CALL step() [L48] COND FALSE !(last_1_var_1_13 == last_1_var_1_1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L55] signed long int stepLocal_3 = (var_1_6 + var_1_8) - var_1_5; [L56] signed short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_2=-64, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L57] COND FALSE !(var_1_11 < stepLocal_2) [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L66] COND TRUE var_1_11 < 5 [L67] var_1_17 = ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L69] var_1_24 = var_1_25 [L70] var_1_26 = var_1_11 [L71] signed long int stepLocal_1 = var_1_1 * (var_1_15 % var_1_12); VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_1=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L72] COND TRUE (- var_1_15) >= stepLocal_1 [L73] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L75] COND FALSE !(\read(var_1_24)) [L80] var_1_21 = (var_1_15 - 2) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L82] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L83] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L86] COND TRUE stepLocal_0 <= (var_1_21 / var_1_12) [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((last_1_var_1_13 == last_1_var_1_1) ? ((last_1_var_1_1 <= ((((last_1_var_1_13) > (last_1_var_1_26)) ? (last_1_var_1_13) : (last_1_var_1_26)))) ? (var_1_1 == ((signed short int) (last_1_var_1_1 + (((((last_1_var_1_15 - last_1_var_1_15)) < ((last_1_var_1_15 - last_1_var_1_15))) ? ((last_1_var_1_15 - last_1_var_1_15)) : ((last_1_var_1_15 - last_1_var_1_15))))))) : (var_1_1 == ((signed short int) (((((last_1_var_1_15 - last_1_var_1_15)) < (((last_1_var_1_15 - last_1_var_1_15) + -256))) ? ((last_1_var_1_15 - last_1_var_1_15)) : (((last_1_var_1_15 - last_1_var_1_15) + -256))))))) : 1) && (var_1_24 ? (var_1_9 == ((signed char) var_1_11)) : ((var_1_15 <= (var_1_21 / var_1_12)) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_11))))) && (((- var_1_15) >= (var_1_1 * (var_1_15 % var_1_12))) ? (var_1_13 == ((signed short int) var_1_26)) : 1)) && ((var_1_11 < var_1_1) ? ((var_1_7 == ((var_1_6 + var_1_8) - var_1_5)) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && ((var_1_11 < 5) ? (var_1_17 == ((float) ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))))) : 1)) && (var_1_24 ? ((var_1_24 && var_1_24) ? (var_1_21 == ((signed short int) var_1_15)) : 1) : (var_1_21 == ((signed short int) (var_1_15 - 2))))) && (var_1_24 == ((unsigned char) var_1_25))) && (var_1_26 == ((signed char) var_1_11)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 113 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 242 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2242/2280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:00:26,924 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_operatoramount_amount50_file-91.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 bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:00:28,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:00:28,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:00:28,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:00:28,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:00:28,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:00:28,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:00:28,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:00:28,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:00:28,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:00:28,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:00:28,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:00:28,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:00:28,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:00:28,938 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:00:28,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:00:28,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:00:28,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:00:28,939 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 -> bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 [2025-03-08 16:00:29,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:00:29,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:00:29,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:00:29,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:00:29,179 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:00:29,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2025-03-08 16:00:30,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0369819f4/6a74ff03423f44c994d29db2ce52daca/FLAG5b554cf3b [2025-03-08 16:00:30,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:00:30,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2025-03-08 16:00:30,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0369819f4/6a74ff03423f44c994d29db2ce52daca/FLAG5b554cf3b [2025-03-08 16:00:30,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0369819f4/6a74ff03423f44c994d29db2ce52daca [2025-03-08 16:00:30,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:00:30,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:00:30,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:00:30,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:00:30,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:00:30,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9257f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30, skipping insertion in model container [2025-03-08 16:00:30,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:00:30,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_operatoramount_amount50_file-91.i[915,928] [2025-03-08 16:00:30,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:00:30,765 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:00:30,772 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_operatoramount_amount50_file-91.i[915,928] [2025-03-08 16:00:30,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:00:30,818 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:00:30,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30 WrapperNode [2025-03-08 16:00:30,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:00:30,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:00:30,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:00:30,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:00:30,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,863 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-08 16:00:30,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:00:30,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:00:30,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:00:30,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:00:30,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:00:30,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:00:30,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:00:30,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:00:30,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:00:30,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (1/1) ... [2025-03-08 16:00:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:00:30,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:00:30,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:00:30,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:00:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:00:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:00:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:00:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:00:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:00:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:00:31,040 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:00:31,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:00:31,583 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 16:00:31,583 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:00:31,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:00:31,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:00:31,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:31 BoogieIcfgContainer [2025-03-08 16:00:31,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:00:31,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:00:31,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:00:31,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:00:31,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:00:30" (1/3) ... [2025-03-08 16:00:31,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f51ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:00:31, skipping insertion in model container [2025-03-08 16:00:31,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:30" (2/3) ... [2025-03-08 16:00:31,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f51ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:00:31, skipping insertion in model container [2025-03-08 16:00:31,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:31" (3/3) ... [2025-03-08 16:00:31,616 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-91.i [2025-03-08 16:00:31,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:00:31,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-91.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:00:31,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:00:31,673 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;@40a2c0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:00:31,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:00:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:00:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:00:31,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:31,682 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:31,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:31,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1517056270, now seen corresponding path program 1 times [2025-03-08 16:00:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:00:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308217569] [2025-03-08 16:00:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:00:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:00:31,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:00:31,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:00:31,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:00:31,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:00:31,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:31,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:31,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:00:31,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:00:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-08 16:00:31,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:00:31,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:00:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308217569] [2025-03-08 16:00:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308217569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:31,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:31,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:00:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13324469] [2025-03-08 16:00:31,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:31,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:00:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:00:31,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:00:31,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:00:31,971 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:00:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:31,985 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-03-08 16:00:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:00:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-08 16:00:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:31,990 INFO L225 Difference]: With dead ends: 118 [2025-03-08 16:00:31,990 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 16:00:31,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:00:31,998 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:31,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:00:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 16:00:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 16:00:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:00:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-03-08 16:00:32,035 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 129 [2025-03-08 16:00:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:32,035 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-03-08 16:00:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:00:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-03-08 16:00:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:00:32,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:32,038 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:32,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:00:32,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:00:32,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:32,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1379337296, now seen corresponding path program 1 times [2025-03-08 16:00:32,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:00:32,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943897546] [2025-03-08 16:00:32,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:00:32,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:00:32,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:00:32,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:00:32,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:00:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:00:32,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:32,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:32,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:00:32,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:00:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:00:32,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:00:32,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:00:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943897546] [2025-03-08 16:00:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943897546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:00:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079453396] [2025-03-08 16:00:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:32,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:00:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:00:32,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:00:32,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:00:32,591 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:00:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:33,522 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2025-03-08 16:00:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:00:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-08 16:00:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:33,528 INFO L225 Difference]: With dead ends: 174 [2025-03-08 16:00:33,529 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 16:00:33,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:00:33,530 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:33,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 279 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:00:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 16:00:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 62. [2025-03-08 16:00:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:00:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2025-03-08 16:00:33,546 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 129 [2025-03-08 16:00:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:33,546 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2025-03-08 16:00:33,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:00:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2025-03-08 16:00:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 16:00:33,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:33,547 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:33,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:00:33,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:00:33,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -102420748, now seen corresponding path program 1 times [2025-03-08 16:00:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:00:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710454454] [2025-03-08 16:00:33,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:33,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:00:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:00:33,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:00:33,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:00:33,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 16:00:34,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 16:00:34,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:34,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 16:00:34,013 INFO L279 TraceCheckSpWp]: Computing forward predicates...