./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.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 7ca944ec6e7910faed55d0ca0d3f894cbbaa606bb58bc6116beacb782c840d74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:22:21,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:22:21,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:22:21,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:22:21,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:22:21,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:22:21,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:22:21,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:22:21,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:22:21,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:22:21,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:22:21,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:22:21,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:22:21,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:22:21,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:22:21,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:22:21,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:22:21,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:22:21,348 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 -> 7ca944ec6e7910faed55d0ca0d3f894cbbaa606bb58bc6116beacb782c840d74 [2025-03-08 13:22:21,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:22:21,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:22:21,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:22:21,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:22:21,577 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:22:21,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i [2025-03-08 13:22:22,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cbfb39a/77a31d21a7fa4c70a63bab9f0fb01be1/FLAGabe6e20e8 [2025-03-08 13:22:22,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:22:22,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i [2025-03-08 13:22:22,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cbfb39a/77a31d21a7fa4c70a63bab9f0fb01be1/FLAGabe6e20e8 [2025-03-08 13:22:22,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cbfb39a/77a31d21a7fa4c70a63bab9f0fb01be1 [2025-03-08 13:22:22,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:22:22,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:22:22,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:22,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:22:22,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:22:22,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:22" (1/1) ... [2025-03-08 13:22:22,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31499c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:22, skipping insertion in model container [2025-03-08 13:22:22,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:22" (1/1) ... [2025-03-08 13:22:23,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:22:23,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i[913,926] [2025-03-08 13:22:23,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:23,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:22:23,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i[913,926] [2025-03-08 13:22:23,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:23,218 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:22:23,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23 WrapperNode [2025-03-08 13:22:23,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:23,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:23,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:22:23,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:22:23,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,259 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2025-03-08 13:22:23,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:23,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:22:23,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:22:23,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:22:23,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,282 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:22:23,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:22:23,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:22:23,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:22:23,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:22:23,292 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (1/1) ... [2025-03-08 13:22:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:22:23,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:22:23,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:22:23,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:22:23,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:22:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:22:23,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:22:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:22:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:22:23,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:22:23,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:22:23,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:22:23,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-03-08 13:22:23,656 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 13:22:23,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:22:23,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:22:23,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:22:23,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:23 BoogieIcfgContainer [2025-03-08 13:22:23,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:22:23,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:22:23,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:22:23,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:22:23,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:22:22" (1/3) ... [2025-03-08 13:22:23,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a00358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:23, skipping insertion in model container [2025-03-08 13:22:23,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:23" (2/3) ... [2025-03-08 13:22:23,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a00358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:23, skipping insertion in model container [2025-03-08 13:22:23,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:23" (3/3) ... [2025-03-08 13:22:23,683 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-24.i [2025-03-08 13:22:23,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:22:23,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-24.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:22:23,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:22:23,749 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;@3ac92ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:22:23,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:22:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:22:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:22:23,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:23,763 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:23,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1209088629, now seen corresponding path program 1 times [2025-03-08 13:22:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:22:23,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111355208] [2025-03-08 13:22:23,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:22:23,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:22:23,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:22:23,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:23,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:22:23,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:22:23,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111355208] [2025-03-08 13:22:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111355208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:22:23,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955242026] [2025-03-08 13:22:23,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:22:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:22:23,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:22:23,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:22:24,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:22:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:22:24,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:24,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:24,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:22:24,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:22:24,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955242026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:22:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:22:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697057087] [2025-03-08 13:22:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:24,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:22:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:22:24,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:22:24,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:24,119 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:22:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:24,141 INFO L93 Difference]: Finished difference Result 144 states and 243 transitions. [2025-03-08 13:22:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:22:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2025-03-08 13:22:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:24,147 INFO L225 Difference]: With dead ends: 144 [2025-03-08 13:22:24,147 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 13:22:24,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:24,151 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:24,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:22:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 13:22:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 13:22:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:22:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2025-03-08 13:22:24,183 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 131 [2025-03-08 13:22:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:24,183 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-03-08 13:22:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:22:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2025-03-08 13:22:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:22:24,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:24,186 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:24,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:22:24,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:22:24,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:24,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash 250281397, now seen corresponding path program 1 times [2025-03-08 13:22:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:22:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165073599] [2025-03-08 13:22:24,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:22:24,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:22:24,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:22:24,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:24,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:22:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:22:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165073599] [2025-03-08 13:22:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165073599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:22:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746120392] [2025-03-08 13:22:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:22:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:22:24,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:22:24,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:22:24,769 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:24,962 INFO L93 Difference]: Finished difference Result 240 states and 367 transitions. [2025-03-08 13:22:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:22:24,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 13:22:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:24,965 INFO L225 Difference]: With dead ends: 240 [2025-03-08 13:22:24,965 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 13:22:24,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:22:24,966 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 115 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:24,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 321 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:22:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 13:22:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 139. [2025-03-08 13:22:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:22:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2025-03-08 13:22:25,000 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 131 [2025-03-08 13:22:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:25,000 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2025-03-08 13:22:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2025-03-08 13:22:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 13:22:25,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:25,004 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:25,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:22:25,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:25,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1526115578, now seen corresponding path program 1 times [2025-03-08 13:22:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:22:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733813752] [2025-03-08 13:22:25,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:22:25,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 13:22:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 13:22:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:25,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 13:22:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:22:25,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733813752] [2025-03-08 13:22:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733813752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:25,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:25,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 13:22:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513130466] [2025-03-08 13:22:25,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:25,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 13:22:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:22:25,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 13:22:25,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:22:25,396 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:25,742 INFO L93 Difference]: Finished difference Result 341 states and 506 transitions. [2025-03-08 13:22:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 13:22:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-03-08 13:22:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:25,745 INFO L225 Difference]: With dead ends: 341 [2025-03-08 13:22:25,745 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 13:22:25,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:22:25,749 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 149 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:25,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 294 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:22:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 13:22:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 147. [2025-03-08 13:22:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:22:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2025-03-08 13:22:25,778 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 132 [2025-03-08 13:22:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:25,779 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2025-03-08 13:22:25,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2025-03-08 13:22:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 13:22:25,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:25,782 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:25,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:22:25,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:25,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 270835781, now seen corresponding path program 1 times [2025-03-08 13:22:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:22:25,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523019029] [2025-03-08 13:22:25,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:22:25,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 13:22:25,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 13:22:25,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:25,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:22:25,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:22:25,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 13:22:25,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 13:22:25,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:25,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:22:25,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:22:25,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:22:25,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:22:25,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:22:25,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 13:22:26,061 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:22:26,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:22:26 BoogieIcfgContainer [2025-03-08 13:22:26,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:22:26,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:22:26,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:22:26,073 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:22:26,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:23" (3/4) ... [2025-03-08 13:22:26,077 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:22:26,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:22:26,078 INFO L158 Benchmark]: Toolchain (without parser) took 3088.27ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 133.0MB in the end (delta: -5.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2025-03-08 13:22:26,079 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:22:26,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.60ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 114.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:22:26,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 112.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:22:26,080 INFO L158 Benchmark]: Boogie Preprocessor took 29.40ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:22:26,080 INFO L158 Benchmark]: IcfgBuilder took 385.77ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 89.7MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:22:26,080 INFO L158 Benchmark]: TraceAbstraction took 2386.11ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 42.4MB in the end (delta: 46.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2025-03-08 13:22:26,081 INFO L158 Benchmark]: Witness Printer took 13.45ms. Allocated memory is still 167.8MB. Free memory was 42.4MB in the beginning and 133.0MB in the end (delta: -90.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:22:26,082 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.60ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 114.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 112.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.40ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 385.77ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 89.7MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2386.11ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 42.4MB in the end (delta: 46.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 13.45ms. Allocated memory is still 167.8MB. Free memory was 42.4MB in the beginning and 133.0MB in the end (delta: -90.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 56, overapproximation of someBinaryArithmeticDOUBLEoperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] signed char last_1_var_1_8 = -10; [L41] signed short int last_1_var_1_21 = -50; [L42] unsigned char last_1_var_1_23 = 1; VAL [isInitial=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L128] last_1_var_1_8 = var_1_8 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L95] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L98] var_1_10 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L99] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L101] var_1_11 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L102] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L104] var_1_12 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L105] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L109] var_1_15 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L110] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L111] var_1_17 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L114] var_1_18 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L115] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L117] var_1_19 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L118] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L120] var_1_20 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L121] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L122] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L122] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L123] var_1_24 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_8=-10] [L124] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_8=-10] [L125] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L125] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L141] RET updateVariables() [L142] CALL step() [L46] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L47] COND TRUE \read(last_1_var_1_23) [L48] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=4] [L53] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L54] COND TRUE 128u >= var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L55] COND TRUE ! var_1_23 [L56] var_1_13 = ((var_1_14 - var_1_15) + 0.25) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=0, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L65] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L66] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L74] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L83] unsigned char stepLocal_1 = var_1_23; [L84] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=4, stepLocal_1=0, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_1=79/5, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L85] COND TRUE stepLocal_0 >= var_1_16 [L86] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L133-L134] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=1073741824, var_1_18=1073741823, var_1_19=-4294967296, var_1_20=4294967297, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 134 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 722 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 353 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 90 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3002/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:22:26,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.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 7ca944ec6e7910faed55d0ca0d3f894cbbaa606bb58bc6116beacb782c840d74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:22:27,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:22:28,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:22:28,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:22:28,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:22:28,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:22:28,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:22:28,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:22:28,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:22:28,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:22:28,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:22:28,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:22:28,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:22:28,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:22:28,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:22:28,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:22:28,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:22:28,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:22:28,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:22:28,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:22:28,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:22:28,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:22:28,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:22:28,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:22:28,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:22:28,048 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 -> 7ca944ec6e7910faed55d0ca0d3f894cbbaa606bb58bc6116beacb782c840d74 [2025-03-08 13:22:28,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:22:28,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:22:28,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:22:28,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:22:28,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:22:28,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i [2025-03-08 13:22:29,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ba5928/e9a7e26a0e00413c95b7daecd178daca/FLAG12d8c58e8 [2025-03-08 13:22:29,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:22:29,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i [2025-03-08 13:22:29,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ba5928/e9a7e26a0e00413c95b7daecd178daca/FLAG12d8c58e8 [2025-03-08 13:22:29,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ba5928/e9a7e26a0e00413c95b7daecd178daca [2025-03-08 13:22:29,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:22:29,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:22:29,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:29,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:22:29,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:22:29,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:29" (1/1) ... [2025-03-08 13:22:29,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd45c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:29, skipping insertion in model container [2025-03-08 13:22:29,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:29" (1/1) ... [2025-03-08 13:22:29,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:22:30,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i[913,926] [2025-03-08 13:22:30,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:30,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:22:30,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-24.i[913,926] [2025-03-08 13:22:30,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:30,208 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:22:30,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30 WrapperNode [2025-03-08 13:22:30,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:30,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:30,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:22:30,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:22:30,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,253 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-08 13:22:30,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:30,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:22:30,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:22:30,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:22:30,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,278 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:22:30,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:22:30,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:22:30,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:22:30,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:22:30,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (1/1) ... [2025-03-08 13:22:30,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:22:30,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:22:30,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:22:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:22:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:22:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:22:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:22:30,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:22:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:22:30,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:22:30,421 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:22:30,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:22:32,735 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:22:32,736 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:22:32,742 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:22:32,742 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:22:32,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:32 BoogieIcfgContainer [2025-03-08 13:22:32,742 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:22:32,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:22:32,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:22:32,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:22:32,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:22:29" (1/3) ... [2025-03-08 13:22:32,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaeff53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:32, skipping insertion in model container [2025-03-08 13:22:32,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:30" (2/3) ... [2025-03-08 13:22:32,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaeff53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:32, skipping insertion in model container [2025-03-08 13:22:32,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:32" (3/3) ... [2025-03-08 13:22:32,751 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-24.i [2025-03-08 13:22:32,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:22:32,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-24.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:22:32,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:22:32,814 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;@4aeab19b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:22:32,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:22:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:22:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 13:22:32,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:32,829 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:32,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:32,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1166120643, now seen corresponding path program 1 times [2025-03-08 13:22:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295496587] [2025-03-08 13:22:32,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:32,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:32,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:32,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:32,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:22:32,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 13:22:33,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 13:22:33,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:33,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:33,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:22:33,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-08 13:22:33,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:33,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:33,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295496587] [2025-03-08 13:22:33,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295496587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:33,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:22:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109880208] [2025-03-08 13:22:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:33,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:22:33,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:22:33,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:33,226 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:22:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:33,242 INFO L93 Difference]: Finished difference Result 122 states and 209 transitions. [2025-03-08 13:22:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:22:33,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-08 13:22:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:33,249 INFO L225 Difference]: With dead ends: 122 [2025-03-08 13:22:33,249 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 13:22:33,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:33,253 INFO L435 NwaCegarLoop]: 92 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, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:33,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:22:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 13:22:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 13:22:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:22:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 92 transitions. [2025-03-08 13:22:33,281 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 92 transitions. Word has length 129 [2025-03-08 13:22:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 92 transitions. [2025-03-08 13:22:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:22:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 92 transitions. [2025-03-08 13:22:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 13:22:33,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:33,284 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:33,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:22:33,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:33,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:33,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2106381821, now seen corresponding path program 1 times [2025-03-08 13:22:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013828750] [2025-03-08 13:22:33,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:33,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:33,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:33,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:22:33,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 13:22:33,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 13:22:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:33,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:22:33,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 13:22:34,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:34,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:34,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013828750] [2025-03-08 13:22:34,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013828750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:34,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:34,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:22:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186805425] [2025-03-08 13:22:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:34,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:22:34,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:34,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:22:34,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:22:34,892 INFO L87 Difference]: Start difference. First operand 61 states and 92 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:36,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:38,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:38,807 INFO L93 Difference]: Finished difference Result 195 states and 297 transitions. [2025-03-08 13:22:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:22:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-08 13:22:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:38,828 INFO L225 Difference]: With dead ends: 195 [2025-03-08 13:22:38,828 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 13:22:38,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:22:38,829 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:38,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 265 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 13:22:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 13:22:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2025-03-08 13:22:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:22:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 176 transitions. [2025-03-08 13:22:38,860 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 176 transitions. Word has length 129 [2025-03-08 13:22:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:38,860 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 176 transitions. [2025-03-08 13:22:38,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 176 transitions. [2025-03-08 13:22:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 13:22:38,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:38,861 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:38,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:22:39,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:39,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:39,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1504402728, now seen corresponding path program 1 times [2025-03-08 13:22:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:39,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018221046] [2025-03-08 13:22:39,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:39,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:39,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:39,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:39,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:22:39,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 13:22:39,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 13:22:39,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:39,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:39,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:22:39,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 13:22:39,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:39,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018221046] [2025-03-08 13:22:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018221046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 13:22:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781074653] [2025-03-08 13:22:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 13:22:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:39,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 13:22:39,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:22:39,406 INFO L87 Difference]: Start difference. First operand 116 states and 176 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:42,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:42,778 INFO L93 Difference]: Finished difference Result 295 states and 432 transitions. [2025-03-08 13:22:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 13:22:42,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-08 13:22:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:42,781 INFO L225 Difference]: With dead ends: 295 [2025-03-08 13:22:42,783 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 13:22:42,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:22:42,786 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 115 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:42,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 250 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 13:22:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 13:22:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 124. [2025-03-08 13:22:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 13:22:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2025-03-08 13:22:42,813 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 130 [2025-03-08 13:22:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:42,814 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2025-03-08 13:22:42,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 13:22:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2025-03-08 13:22:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 13:22:42,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:42,817 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:22:42,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 13:22:43,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:43,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:43,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash -303051735, now seen corresponding path program 1 times [2025-03-08 13:22:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558968660] [2025-03-08 13:22:43,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:43,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:43,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:43,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:43,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 13:22:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 13:22:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 13:22:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:43,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:43,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 13:22:43,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:23:46,208 WARN L286 SmtUtils]: Spent 24.44s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)