./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.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 d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:56:03,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:56:03,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:56:03,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:56:03,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:56:03,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:56:03,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:56:03,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:56:03,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:56:03,612 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:56:03,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:56:03,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:56:03,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:56:03,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:56:03,614 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:56:03,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:56:03,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:56:03,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:56:03,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:56:03,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:56:03,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:56:03,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:56:03,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:56:03,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:56:03,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:56:03,617 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 -> d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 [2025-03-03 18:56:03,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:56:03,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:56:03,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:56:03,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:56:03,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:56:03,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2025-03-03 18:56:04,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42625f9b5/3609ed3610614b158955a4469eeea8f1/FLAG705e0736c [2025-03-03 18:56:05,226 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:56:05,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2025-03-03 18:56:05,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42625f9b5/3609ed3610614b158955a4469eeea8f1/FLAG705e0736c [2025-03-03 18:56:05,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42625f9b5/3609ed3610614b158955a4469eeea8f1 [2025-03-03 18:56:05,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:56:05,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:56:05,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:56:05,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:56:05,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:56:05,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764d4eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05, skipping insertion in model container [2025-03-03 18:56:05,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:56:05,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i[913,926] [2025-03-03 18:56:05,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:56:05,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:56:05,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i[913,926] [2025-03-03 18:56:05,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:56:05,752 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:56:05,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05 WrapperNode [2025-03-03 18:56:05,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:56:05,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:56:05,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:56:05,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:56:05,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,799 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-03 18:56:05,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:56:05,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:56:05,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:56:05,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:56:05,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,823 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:56:05,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:56:05,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:56:05,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:56:05,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:56:05,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (1/1) ... [2025-03-03 18:56:05,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:56:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:56:05,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:56:05,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:56:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:56:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:56:05,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:56:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:56:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:56:05,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:56:05,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:56:05,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:56:06,254 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:56:06,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:56:06,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:56:06,266 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:56:06,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:56:06 BoogieIcfgContainer [2025-03-03 18:56:06,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:56:06,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:56:06,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:56:06,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:56:06,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:56:05" (1/3) ... [2025-03-03 18:56:06,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63900a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:56:06, skipping insertion in model container [2025-03-03 18:56:06,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:05" (2/3) ... [2025-03-03 18:56:06,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63900a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:56:06, skipping insertion in model container [2025-03-03 18:56:06,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:56:06" (3/3) ... [2025-03-03 18:56:06,274 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-85.i [2025-03-03 18:56:06,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:56:06,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-85.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:56:06,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:56:06,346 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;@b975ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:56:06,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:56:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:56:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 18:56:06,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:06,360 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:06,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 208413261, now seen corresponding path program 1 times [2025-03-03 18:56:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361049763] [2025-03-03 18:56:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:06,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:06,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:06,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:06,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 18:56:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361049763] [2025-03-03 18:56:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361049763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:56:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666219465] [2025-03-03 18:56:06,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:06,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:56:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:56:06,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:56:06,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:56:06,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:06,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:06,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:06,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:06,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:56:06,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:56:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 18:56:06,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:56:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666219465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:56:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:56:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951419144] [2025-03-03 18:56:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:56:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:06,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:56:06,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:56:06,835 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 18:56:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:06,857 INFO L93 Difference]: Finished difference Result 118 states and 203 transitions. [2025-03-03 18:56:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:56:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-03-03 18:56:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:06,864 INFO L225 Difference]: With dead ends: 118 [2025-03-03 18:56:06,864 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 18:56:06,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:56:06,872 INFO L435 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:06,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:56:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 18:56:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 18:56:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:56:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-03 18:56:06,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2025-03-03 18:56:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:06,905 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-03 18:56:06,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 18:56:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-03 18:56:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 18:56:06,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:06,907 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:06,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:56:07,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:56:07,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:07,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 702808647, now seen corresponding path program 1 times [2025-03-03 18:56:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106477668] [2025-03-03 18:56:07,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:07,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:07,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:07,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2025-03-03 18:56:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:08,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106477668] [2025-03-03 18:56:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106477668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:56:08,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068760922] [2025-03-03 18:56:08,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:08,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:56:08,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:56:08,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:56:08,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:56:08,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:08,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:08,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:08,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 18:56:08,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:56:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 553 proven. 45 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-03-03 18:56:08,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:56:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 48 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-03-03 18:56:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068760922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:56:08,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:56:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 18:56:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645971157] [2025-03-03 18:56:08,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:56:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:56:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:08,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:56:08,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:56:08,871 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-03 18:56:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:09,497 INFO L93 Difference]: Finished difference Result 222 states and 311 transitions. [2025-03-03 18:56:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 18:56:09,497 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 139 [2025-03-03 18:56:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:09,499 INFO L225 Difference]: With dead ends: 222 [2025-03-03 18:56:09,499 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 18:56:09,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 18:56:09,500 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 183 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:09,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 262 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:56:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 18:56:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2025-03-03 18:56:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 18:56:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2025-03-03 18:56:09,531 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 139 [2025-03-03 18:56:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:09,533 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2025-03-03 18:56:09,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-03 18:56:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2025-03-03 18:56:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 18:56:09,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:09,535 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:09,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:56:09,740 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,SelfDestructingSolverStorable1 [2025-03-03 18:56:09,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash 703732168, now seen corresponding path program 1 times [2025-03-03 18:56:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791322205] [2025-03-03 18:56:09,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:09,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:09,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:09,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:09,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:56:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142487884] [2025-03-03 18:56:09,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:09,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:56:09,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:56:09,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:56:09,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:56:09,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:09,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:09,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:09,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:56:09,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:56:09,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:09,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:09,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:09,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:56:10,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:56:10,036 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:56:10,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:56:10,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:56:10,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:56:10,244 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 18:56:10,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:56:10,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:56:10 BoogieIcfgContainer [2025-03-03 18:56:10,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:56:10,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:56:10,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:56:10,318 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:56:10,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:56:06" (3/4) ... [2025-03-03 18:56:10,321 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:56:10,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:56:10,323 INFO L158 Benchmark]: Toolchain (without parser) took 4768.96ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 61.8MB in the end (delta: 49.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-03-03 18:56:10,323 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:56:10,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.92ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:56:10,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.55ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:56:10,324 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 89.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:56:10,324 INFO L158 Benchmark]: IcfgBuilder took 433.78ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 69.1MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:56:10,324 INFO L158 Benchmark]: TraceAbstraction took 4049.50ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 61.8MB in the end (delta: 6.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2025-03-03 18:56:10,325 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:56:10,326 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.20ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.92ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.55ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 89.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 433.78ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 69.1MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4049.50ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 61.8MB in the end (delta: 6.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned short int var_1_2 = 2; [L24] unsigned short int var_1_3 = 8; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 0.6; [L29] unsigned long int var_1_8 = 32; [L30] unsigned long int var_1_9 = 32; [L31] float var_1_10 = 49.359; [L32] float var_1_11 = 5.5; [L33] unsigned long int var_1_12 = 128; [L34] unsigned char var_1_13 = 16; [L35] unsigned char var_1_14 = 0; [L36] unsigned long int var_1_15 = 8; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] double var_1_18 = 1.8; [L40] double var_1_19 = 4.5; [L41] double var_1_20 = 15.5; VAL [isInitial=0, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_2=2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L81] var_1_2 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L82] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] var_1_3 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L86] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L86] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L87] var_1_4 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L88] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L89] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L89] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L90] var_1_6 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L91] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L92] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L92] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L93] var_1_8 = __VERIFIER_nondet_ulong() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L95] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L95] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L96] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=32] [L96] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=32] [L97] var_1_9 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34] [L98] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34] [L99] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34] [L99] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34] [L100] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L100] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L101] var_1_10 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L102] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L103] var_1_11 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L104] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L107] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L107] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L108] var_1_17 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L109] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L110] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L110] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L111] var_1_19 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L112] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L113] var_1_20 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L114] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L127] RET updateVariables() [L128] CALL step() [L45] COND FALSE !(var_1_2 < ((- var_1_3) * 64)) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L56] COND TRUE var_1_2 <= (var_1_3 + var_1_1) [L57] var_1_5 = ((var_1_3 == var_1_2) && var_1_6) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=34, var_1_9=1000] [L61] COND FALSE !((var_1_2 + (var_1_3 * var_1_1)) <= ((32u / var_1_8) / var_1_9)) [L66] var_1_7 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L68] COND TRUE var_1_7 <= (- (32.8f + var_1_10)) [L69] var_1_12 = var_1_3 VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L71] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L72] COND FALSE !(\read(var_1_4)) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L75] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L76] COND FALSE !(var_1_5 || var_1_17) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L128] RET step() [L129] CALL, EXPR property() [L119-L120] return ((((((((var_1_2 < ((- var_1_3) * 64)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : ((-10000000 < var_1_2) ? (var_1_1 == ((unsigned long int) (((((((var_1_3) > (5u)) ? (var_1_3) : (5u))) < 0 ) ? -((((var_1_3) > (5u)) ? (var_1_3) : (5u))) : ((((var_1_3) > (5u)) ? (var_1_3) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((var_1_2 <= (var_1_3 + var_1_1)) ? (var_1_5 == ((unsigned char) ((var_1_3 == var_1_2) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_2 + (var_1_3 * var_1_1)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_10) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_10))) ? (var_1_12 == ((unsigned long int) var_1_3)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_4 ? (var_1_15 == ((unsigned long int) ((((var_1_3) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_3) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=34, var_1_9=1000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 170 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 412 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 65 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 1690 SizeOfPredicates, 5 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4440/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:56:10,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.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 d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:56:12,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:56:12,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:56:12,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:56:12,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:56:12,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:56:12,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:56:12,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:56:12,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:56:12,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:56:12,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:56:12,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:56:12,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:56:12,358 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:56:12,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:56:12,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:56:12,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:56:12,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:56:12,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:56:12,359 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:56:12,359 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:56:12,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:56:12,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:56:12,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:56:12,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:56:12,360 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 -> d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 [2025-03-03 18:56:12,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:56:12,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:56:12,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:56:12,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:56:12,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:56:12,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2025-03-03 18:56:13,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad1c71d5/801686b84dc84d4385b66da59ba06546/FLAG06b023ef8 [2025-03-03 18:56:13,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:56:13,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2025-03-03 18:56:13,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad1c71d5/801686b84dc84d4385b66da59ba06546/FLAG06b023ef8 [2025-03-03 18:56:14,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad1c71d5/801686b84dc84d4385b66da59ba06546 [2025-03-03 18:56:14,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:56:14,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:56:14,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:56:14,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:56:14,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:56:14,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19843291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14, skipping insertion in model container [2025-03-03 18:56:14,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:56:14,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i[913,926] [2025-03-03 18:56:14,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:56:14,526 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:56:14,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i[913,926] [2025-03-03 18:56:14,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:56:14,562 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:56:14,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14 WrapperNode [2025-03-03 18:56:14,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:56:14,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:56:14,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:56:14,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:56:14,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,600 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-03 18:56:14,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:56:14,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:56:14,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:56:14,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:56:14,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,619 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:56:14,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:56:14,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:56:14,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:56:14,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:56:14,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (1/1) ... [2025-03-03 18:56:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:56:14,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:56:14,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:56:14,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:56:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:56:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:56:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:56:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:56:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:56:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:56:14,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:56:14,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:56:17,326 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:56:17,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:56:17,334 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:56:17,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:56:17,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:56:17 BoogieIcfgContainer [2025-03-03 18:56:17,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:56:17,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:56:17,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:56:17,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:56:17,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:56:14" (1/3) ... [2025-03-03 18:56:17,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb0e39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:56:17, skipping insertion in model container [2025-03-03 18:56:17,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:56:14" (2/3) ... [2025-03-03 18:56:17,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb0e39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:56:17, skipping insertion in model container [2025-03-03 18:56:17,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:56:17" (3/3) ... [2025-03-03 18:56:17,343 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-85.i [2025-03-03 18:56:17,354 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:56:17,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-85.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:56:17,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:56:17,405 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;@34b0631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:56:17,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:56:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:56:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 18:56:17,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:17,417 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:17,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 208413261, now seen corresponding path program 1 times [2025-03-03 18:56:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:56:17,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591468680] [2025-03-03 18:56:17,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:56:17,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:56:17,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:56:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 18:56:17,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:17,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:17,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:56:17,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:56:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 18:56:17,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:56:17,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:56:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591468680] [2025-03-03 18:56:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591468680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:17,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:17,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:56:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408017015] [2025-03-03 18:56:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:17,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:56:17,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:56:17,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:56:17,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:56:17,858 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 18:56:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:17,880 INFO L93 Difference]: Finished difference Result 118 states and 203 transitions. [2025-03-03 18:56:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:56:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-03-03 18:56:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:17,886 INFO L225 Difference]: With dead ends: 118 [2025-03-03 18:56:17,886 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 18:56:17,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:56:17,891 INFO L435 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:17,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:56:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 18:56:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 18:56:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:56:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-03 18:56:17,932 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2025-03-03 18:56:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:17,933 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-03 18:56:17,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 18:56:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-03 18:56:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 18:56:17,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:17,937 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:17,952 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-03 18:56:18,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:56:18,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash 702808647, now seen corresponding path program 1 times [2025-03-03 18:56:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:56:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841193892] [2025-03-03 18:56:18,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:18,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:56:18,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:56:18,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:56:18,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 18:56:18,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:18,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:18,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:18,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:18,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 18:56:18,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:56:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 553 proven. 45 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-03-03 18:56:19,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:56:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 48 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-03-03 18:56:19,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:56:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841193892] [2025-03-03 18:56:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841193892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:56:19,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:56:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-03 18:56:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258051150] [2025-03-03 18:56:19,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:56:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:56:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:56:19,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:56:19,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:56:19,842 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-03 18:56:22,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 18:56:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:22,992 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2025-03-03 18:56:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:56:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 139 [2025-03-03 18:56:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:22,994 INFO L225 Difference]: With dead ends: 168 [2025-03-03 18:56:22,995 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 18:56:22,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2025-03-03 18:56:22,996 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:22,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 278 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 18:56:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 18:56:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2025-03-03 18:56:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 18:56:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2025-03-03 18:56:23,016 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 139 [2025-03-03 18:56:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:23,017 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2025-03-03 18:56:23,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-03 18:56:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2025-03-03 18:56:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 18:56:23,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:23,019 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:23,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:56:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:56:23,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 703732168, now seen corresponding path program 1 times [2025-03-03 18:56:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:56:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961864044] [2025-03-03 18:56:23,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:23,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:56:23,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:56:23,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:56:23,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 18:56:23,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 18:56:23,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 18:56:23,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:23,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 18:56:23,544 INFO L279 TraceCheckSpWp]: Computing forward predicates...