./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.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 8633596662ab62787a48c295f40fc88c07e0c2a44027397c2cc6b2f923927ff7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:36:10,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:36:10,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:36:10,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:36:10,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:36:10,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:36:10,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:36:10,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:36:10,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:36:10,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:36:10,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:36:10,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:36:10,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:36:10,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:36:10,173 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:36:10,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:36:10,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:36:10,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:36:10,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:36:10,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:10,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:36:10,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:36:10,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:36:10,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:36:10,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:36:10,176 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 -> 8633596662ab62787a48c295f40fc88c07e0c2a44027397c2cc6b2f923927ff7 [2025-03-03 21:36:10,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:36:10,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:36:10,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:36:10,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:36:10,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:36:10,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i [2025-03-03 21:36:11,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adda78adb/0e4e79d32312418abbfa2f752a37abd8/FLAG553a0d49c [2025-03-03 21:36:11,770 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:36:11,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i [2025-03-03 21:36:11,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adda78adb/0e4e79d32312418abbfa2f752a37abd8/FLAG553a0d49c [2025-03-03 21:36:12,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adda78adb/0e4e79d32312418abbfa2f752a37abd8 [2025-03-03 21:36:12,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:36:12,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:36:12,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:12,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:36:12,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:36:12,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12, skipping insertion in model container [2025-03-03 21:36:12,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:36:12,179 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_filler-ps-ci_file-25.i[919,932] [2025-03-03 21:36:12,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:12,261 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:36:12,268 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_filler-ps-ci_file-25.i[919,932] [2025-03-03 21:36:12,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:12,322 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:36:12,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12 WrapperNode [2025-03-03 21:36:12,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:12,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:12,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:36:12,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:36:12,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,371 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-03-03 21:36:12,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:12,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:36:12,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:36:12,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:36:12,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,400 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:36:12,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:36:12,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:36:12,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:36:12,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:36:12,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (1/1) ... [2025-03-03 21:36:12,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:12,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:12,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:36:12,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:36:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:36:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:36:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:36:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:36:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:36:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:36:12,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:36:12,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:36:12,843 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:36:12,843 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:36:12,859 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:36:12,860 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:36:12,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:12 BoogieIcfgContainer [2025-03-03 21:36:12,860 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:36:12,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:36:12,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:36:12,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:36:12,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:36:12" (1/3) ... [2025-03-03 21:36:12,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3c2f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:12, skipping insertion in model container [2025-03-03 21:36:12,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:12" (2/3) ... [2025-03-03 21:36:12,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3c2f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:12, skipping insertion in model container [2025-03-03 21:36:12,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:12" (3/3) ... [2025-03-03 21:36:12,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i [2025-03-03 21:36:12,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:36:12,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:36:12,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:36:12,941 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;@f4550df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:36:12,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:36:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 64 states have (on average 1.53125) internal successors, (98), 65 states have internal predecessors, (98), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 21:36:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 21:36:12,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:12,955 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:12,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -637042181, now seen corresponding path program 1 times [2025-03-03 21:36:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891457438] [2025-03-03 21:36:12,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 21:36:13,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 21:36:13,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:13,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 21:36:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891457438] [2025-03-03 21:36:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891457438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:36:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227614896] [2025-03-03 21:36:13,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:13,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:13,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:36:13,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:36:13,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 21:36:13,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 21:36:13,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:13,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:13,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:36:13,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 21:36:13,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227614896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:13,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:36:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:36:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523127072] [2025-03-03 21:36:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:13,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:36:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:13,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:36:13,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:36:13,389 INFO L87 Difference]: Start difference. First operand has 85 states, 64 states have (on average 1.53125) internal successors, (98), 65 states have internal predecessors, (98), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 21:36:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:13,418 INFO L93 Difference]: Finished difference Result 164 states and 281 transitions. [2025-03-03 21:36:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:36:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-03-03 21:36:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:13,425 INFO L225 Difference]: With dead ends: 164 [2025-03-03 21:36:13,427 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 21:36:13,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:36:13,433 INFO L435 NwaCegarLoop]: 126 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, 126 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-03 21:36:13,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:36:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 21:36:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 21:36:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 62 states have internal predecessors, (92), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 21:36:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2025-03-03 21:36:13,475 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 130 [2025-03-03 21:36:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2025-03-03 21:36:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 21:36:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2025-03-03 21:36:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 21:36:13,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:13,478 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:36:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:36:13,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:13,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -930445609, now seen corresponding path program 1 times [2025-03-03 21:36:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437896491] [2025-03-03 21:36:13,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:13,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 21:36:13,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 21:36:13,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:13,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437896491] [2025-03-03 21:36:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437896491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:13,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:36:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727882739] [2025-03-03 21:36:13,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:13,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:36:13,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:13,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:36:13,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:13,941 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:14,012 INFO L93 Difference]: Finished difference Result 162 states and 255 transitions. [2025-03-03 21:36:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:36:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-03 21:36:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:14,015 INFO L225 Difference]: With dead ends: 162 [2025-03-03 21:36:14,015 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 21:36:14,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:14,016 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:14,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:36:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 21:36:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 21:36:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 21:36:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-03 21:36:14,032 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 131 [2025-03-03 21:36:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:14,033 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-03 21:36:14,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-03 21:36:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 21:36:14,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:14,035 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:14,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:36:14,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:14,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1326465398, now seen corresponding path program 1 times [2025-03-03 21:36:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857918114] [2025-03-03 21:36:14,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:14,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 21:36:14,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 21:36:14,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:14,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857918114] [2025-03-03 21:36:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857918114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:14,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:14,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:36:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051559174] [2025-03-03 21:36:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:36:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:14,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:36:14,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:14,341 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:14,392 INFO L93 Difference]: Finished difference Result 226 states and 356 transitions. [2025-03-03 21:36:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:36:14,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-03 21:36:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:14,395 INFO L225 Difference]: With dead ends: 226 [2025-03-03 21:36:14,395 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 21:36:14,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:14,396 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:14,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 228 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:36:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 21:36:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2025-03-03 21:36:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:36:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2025-03-03 21:36:14,419 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 131 [2025-03-03 21:36:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:14,420 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2025-03-03 21:36:14,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2025-03-03 21:36:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 21:36:14,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:14,421 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:36:14,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash -539393032, now seen corresponding path program 1 times [2025-03-03 21:36:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700317704] [2025-03-03 21:36:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:14,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 21:36:14,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 21:36:14,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700317704] [2025-03-03 21:36:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700317704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:36:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85202115] [2025-03-03 21:36:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:14,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:36:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:14,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:36:14,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:14,611 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:14,682 INFO L93 Difference]: Finished difference Result 232 states and 362 transitions. [2025-03-03 21:36:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:36:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-03 21:36:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:14,684 INFO L225 Difference]: With dead ends: 232 [2025-03-03 21:36:14,684 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 21:36:14,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:14,685 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 66 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:14,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:36:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 21:36:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2025-03-03 21:36:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:36:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-03 21:36:14,696 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 131 [2025-03-03 21:36:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:14,696 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-03 21:36:14,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-03 21:36:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 21:36:14,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:14,697 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:36:14,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash 50616727, now seen corresponding path program 1 times [2025-03-03 21:36:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197815510] [2025-03-03 21:36:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:14,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 21:36:14,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 21:36:14,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:14,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197815510] [2025-03-03 21:36:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197815510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:14,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:14,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:36:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110373995] [2025-03-03 21:36:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:14,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:36:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:14,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:36:14,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:36:14,910 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:15,033 INFO L93 Difference]: Finished difference Result 210 states and 323 transitions. [2025-03-03 21:36:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:36:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-03 21:36:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:15,035 INFO L225 Difference]: With dead ends: 210 [2025-03-03 21:36:15,035 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 21:36:15,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:36:15,036 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:15,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 207 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:36:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 21:36:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-03 21:36:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:36:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 191 transitions. [2025-03-03 21:36:15,054 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 191 transitions. Word has length 131 [2025-03-03 21:36:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 191 transitions. [2025-03-03 21:36:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 191 transitions. [2025-03-03 21:36:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 21:36:15,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:15,057 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:36:15,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2141618164, now seen corresponding path program 1 times [2025-03-03 21:36:15,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:15,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514628931] [2025-03-03 21:36:15,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:15,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 21:36:15,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 21:36:15,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:15,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514628931] [2025-03-03 21:36:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514628931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:36:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392879864] [2025-03-03 21:36:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:15,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:36:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:15,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:36:15,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:36:15,438 INFO L87 Difference]: Start difference. First operand 130 states and 191 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:15,734 INFO L93 Difference]: Finished difference Result 262 states and 389 transitions. [2025-03-03 21:36:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:36:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2025-03-03 21:36:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:15,736 INFO L225 Difference]: With dead ends: 262 [2025-03-03 21:36:15,736 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 21:36:15,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:36:15,737 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 206 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:15,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 388 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:36:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 21:36:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2025-03-03 21:36:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 121 states have internal predecessors, (167), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:36:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 239 transitions. [2025-03-03 21:36:15,753 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 239 transitions. Word has length 132 [2025-03-03 21:36:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 239 transitions. [2025-03-03 21:36:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 239 transitions. [2025-03-03 21:36:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 21:36:15,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:15,755 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:36:15,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:15,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash 595030206, now seen corresponding path program 1 times [2025-03-03 21:36:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640167193] [2025-03-03 21:36:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:15,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 21:36:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 21:36:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:36:16,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640167193] [2025-03-03 21:36:16,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640167193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:16,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:16,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:36:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794775735] [2025-03-03 21:36:16,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:16,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:36:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:36:16,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:36:16,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:36:16,172 INFO L87 Difference]: Start difference. First operand 160 states and 239 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:16,276 INFO L93 Difference]: Finished difference Result 246 states and 367 transitions. [2025-03-03 21:36:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:36:16,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-03 21:36:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:16,279 INFO L225 Difference]: With dead ends: 246 [2025-03-03 21:36:16,279 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 21:36:16,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:36:16,280 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 249 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:16,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 177 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:36:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 21:36:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2025-03-03 21:36:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.371900826446281) internal successors, (166), 121 states have internal predecessors, (166), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:36:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2025-03-03 21:36:16,299 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 133 [2025-03-03 21:36:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:16,300 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2025-03-03 21:36:16,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2025-03-03 21:36:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 21:36:16,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:16,301 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:16,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:36:16,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:16,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:16,303 INFO L85 PathProgramCache]: Analyzing trace with hash 398516701, now seen corresponding path program 1 times [2025-03-03 21:36:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:36:16,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282654483] [2025-03-03 21:36:16,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:36:16,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 21:36:16,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 21:36:16,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:16,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:36:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557614732] [2025-03-03 21:36:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:36:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:16,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:36:16,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:36:16,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 21:36:16,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 21:36:16,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:16,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:36:16,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:36:16,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 21:36:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 21:36:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:36:16,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:36:16,566 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:36:16,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:36:16,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:36:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 21:36:16,771 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:16,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:36:16,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:36:16 BoogieIcfgContainer [2025-03-03 21:36:16,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:36:16,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:36:16,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:36:16,874 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:36:16,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:12" (3/4) ... [2025-03-03 21:36:16,876 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:36:16,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:36:16,877 INFO L158 Benchmark]: Toolchain (without parser) took 4827.78ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.9MB in the beginning and 263.0MB in the end (delta: -159.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-03-03 21:36:16,877 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:36:16,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.02ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 88.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:36:16,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 84.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:36:16,878 INFO L158 Benchmark]: Boogie Preprocessor took 40.14ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 80.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:36:16,878 INFO L158 Benchmark]: IcfgBuilder took 447.00ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 52.6MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:36:16,878 INFO L158 Benchmark]: TraceAbstraction took 4009.75ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 52.6MB in the beginning and 263.1MB in the end (delta: -210.5MB). Peak memory consumption was 121.8MB. Max. memory is 16.1GB. [2025-03-03 21:36:16,878 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 310.4MB. Free memory was 263.1MB in the beginning and 263.0MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:36:16,879 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.02ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 88.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 84.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.14ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 80.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 447.00ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 52.6MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4009.75ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 52.6MB in the beginning and 263.1MB in the end (delta: -210.5MB). Peak memory consumption was 121.8MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 310.4MB. Free memory was 263.1MB in the beginning and 263.0MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 195, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] double var_1_28 = 15.5; [L41] unsigned long int var_1_30 = 5; [L42] signed long int var_1_32 = 32; [L43] float var_1_34 = 7.5; [L44] unsigned short int var_1_35 = 100; [L45] unsigned short int var_1_37 = 47055; [L46] signed char var_1_39 = -64; [L47] double var_1_40 = 16.75; [L48] signed char var_1_41 = 16; [L49] signed long int last_1_var_1_1 = -256; [L50] signed short int last_1_var_1_5 = -256; [L51] unsigned char last_1_var_1_10 = 0; [L52] unsigned short int last_1_var_1_19 = 5; [L53] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_5 = var_1_5 [L190] last_1_var_1_10 = var_1_10 [L191] last_1_var_1_19 = var_1_19 [L192] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L157] var_1_7 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L158] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L159] var_1_8 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L160] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L161] var_1_11 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L164] var_1_13 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L166] var_1_14 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L167] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L168] var_1_15 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L169] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] var_1_16 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L174] var_1_18 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L175] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L177] var_1_37 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L180] var_1_40 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L181] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L182] CALL assume_abort_if_not(var_1_40 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L182] RET assume_abort_if_not(var_1_40 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L183] var_1_41 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L184] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L185] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L185] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L203] RET updateVariables() [L204] CALL step() [L57] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L60] COND FALSE !(var_1_19 < var_1_18) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L65] COND TRUE var_1_10 || (var_1_18 <= var_1_18) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L66] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L71] COND FALSE !(var_1_10 || var_1_10) [L74] var_1_30 = var_1_18 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L76] COND FALSE !(var_1_13 > var_1_13) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L87] var_1_34 = var_1_14 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L88] EXPR (var_1_15 % var_1_15) ^ var_1_18 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=100, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L88] COND TRUE ((var_1_15 % var_1_15) ^ var_1_18) != var_1_1 [L89] var_1_35 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) - var_1_18) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=-64, var_1_41=0, var_1_5=-256] [L91] COND FALSE !(((var_1_8 / var_1_40) * var_1_14) > var_1_14) [L100] var_1_39 = var_1_41 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L102] signed long int stepLocal_2 = last_1_var_1_5; [L103] unsigned char stepLocal_1 = last_1_var_1_10; [L104] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L105] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L110] COND TRUE last_1_var_1_1 >= stepLocal_2 [L111] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L116] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L117] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L122] var_1_22 = last_1_var_1_22 [L123] var_1_23 = var_1_14 [L124] unsigned char stepLocal_5 = var_1_10; [L125] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L126] COND FALSE !(var_1_22 < stepLocal_4) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L129] COND FALSE !((var_1_10 || var_1_10) || stepLocal_5) [L132] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L135] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L136] COND TRUE ! (var_1_23 <= var_1_7) [L137] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L145] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L146] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=-256] [L149] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L150] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=50] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=50] [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=18, var_1_17=16, var_1_18=0, var_1_19=50, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=0, var_1_32=32, var_1_34=2, var_1_35=32767, var_1_37=32767, var_1_39=0, var_1_41=0, var_1_5=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 1565 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 765 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 800 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=6, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1315 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1041 ConstructedInterpolants, 0 QuantifiedInterpolants, 2055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 346 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 4862/4896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:36:16,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.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 8633596662ab62787a48c295f40fc88c07e0c2a44027397c2cc6b2f923927ff7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:36:18,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:36:18,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:36:18,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:36:18,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:36:18,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:36:18,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:36:18,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:36:18,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:36:18,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:36:18,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:36:18,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:36:18,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:36:18,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:36:18,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:36:18,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:36:18,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:36:18,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:36:18,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:18,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:36:18,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:36:18,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:36:18,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:36:18,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:36:18,945 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 -> 8633596662ab62787a48c295f40fc88c07e0c2a44027397c2cc6b2f923927ff7 [2025-03-03 21:36:19,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:36:19,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:36:19,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:36:19,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:36:19,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:36:19,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i [2025-03-03 21:36:20,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a0af198/222209b1fd024968ba13db081da33e65/FLAGa638e4709 [2025-03-03 21:36:20,601 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:36:20,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i [2025-03-03 21:36:20,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a0af198/222209b1fd024968ba13db081da33e65/FLAGa638e4709 [2025-03-03 21:36:20,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a0af198/222209b1fd024968ba13db081da33e65 [2025-03-03 21:36:20,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:36:20,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:36:20,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:20,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:36:20,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:36:20,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:20" (1/1) ... [2025-03-03 21:36:20,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42186410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:20, skipping insertion in model container [2025-03-03 21:36:20,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:36:20" (1/1) ... [2025-03-03 21:36:20,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:36:21,075 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_filler-ps-ci_file-25.i[919,932] [2025-03-03 21:36:21,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:21,127 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:36:21,134 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_filler-ps-ci_file-25.i[919,932] [2025-03-03 21:36:21,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:36:21,175 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:36:21,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21 WrapperNode [2025-03-03 21:36:21,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:36:21,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:21,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:36:21,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:36:21,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,204 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-03 21:36:21,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:36:21,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:36:21,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:36:21,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:36:21,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:36:21,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:36:21,241 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:36:21,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:36:21,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:36:21,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (1/1) ... [2025-03-03 21:36:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:36:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:36:21,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:36:21,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:36:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:36:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:36:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:36:21,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:36:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:36:21,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:36:21,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:36:21,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:36:31,767 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:36:31,767 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:36:31,774 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:36:31,774 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:36:31,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:31 BoogieIcfgContainer [2025-03-03 21:36:31,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:36:31,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:36:31,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:36:31,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:36:31,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:36:20" (1/3) ... [2025-03-03 21:36:31,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db831f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:31, skipping insertion in model container [2025-03-03 21:36:31,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:36:21" (2/3) ... [2025-03-03 21:36:31,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db831f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:36:31, skipping insertion in model container [2025-03-03 21:36:31,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:36:31" (3/3) ... [2025-03-03 21:36:31,782 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i [2025-03-03 21:36:31,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:36:31,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-25.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:36:31,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:36:31,836 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;@2b550cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:36:31,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:36:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.5) internal successors, (84), 57 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 21:36:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 21:36:31,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:31,848 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:31,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:31,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -640235086, now seen corresponding path program 1 times [2025-03-03 21:36:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:31,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182507103] [2025-03-03 21:36:31,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:31,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:31,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:36:31,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:36:31,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 21:36:32,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 21:36:32,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:32,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:32,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:36:32,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 21:36:32,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:32,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182507103] [2025-03-03 21:36:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182507103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:36:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825324116] [2025-03-03 21:36:32,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:36:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:32,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:36:32,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:36:32,831 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.5) internal successors, (84), 57 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 21:36:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:32,854 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2025-03-03 21:36:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:36:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-03 21:36:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:32,862 INFO L225 Difference]: With dead ends: 146 [2025-03-03 21:36:32,862 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 21:36:32,866 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-03 21:36:32,868 INFO L435 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:32,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:36:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 21:36:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 21:36:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 21:36:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2025-03-03 21:36:32,904 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 129 [2025-03-03 21:36:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:32,904 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-03-03 21:36:32,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 21:36:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2025-03-03 21:36:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 21:36:32,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:32,907 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:32,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:36:33,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:33,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:33,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash -773178060, now seen corresponding path program 1 times [2025-03-03 21:36:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515987189] [2025-03-03 21:36:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:33,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:33,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:33,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:36:33,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:36:33,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 21:36:33,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 21:36:33,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:34,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:36:34,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:36,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:36,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515987189] [2025-03-03 21:36:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515987189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:36:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139580141] [2025-03-03 21:36:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:36,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:36:36,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:36,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:36:36,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:36,634 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:37,459 INFO L93 Difference]: Finished difference Result 208 states and 317 transitions. [2025-03-03 21:36:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:36:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-03 21:36:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:37,462 INFO L225 Difference]: With dead ends: 208 [2025-03-03 21:36:37,462 INFO L226 Difference]: Without dead ends: 139 [2025-03-03 21:36:37,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:36:37,464 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 42 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:37,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 206 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:36:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-03 21:36:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2025-03-03 21:36:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 21:36:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2025-03-03 21:36:37,481 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 129 [2025-03-03 21:36:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:37,481 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2025-03-03 21:36:37,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2025-03-03 21:36:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 21:36:37,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:37,483 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:37,513 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 (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:36:37,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:37,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:37,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 62762196, now seen corresponding path program 1 times [2025-03-03 21:36:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105120339] [2025-03-03 21:36:37,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:37,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:37,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:37,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:36:37,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:36:37,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 21:36:38,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 21:36:38,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:38,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:36:38,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 21:36:41,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:36:41,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:36:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105120339] [2025-03-03 21:36:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105120339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:36:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:36:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:36:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829763886] [2025-03-03 21:36:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:36:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:36:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:36:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:36:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:36:41,527 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:36:42,546 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2025-03-03 21:36:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:36:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-03 21:36:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:36:42,549 INFO L225 Difference]: With dead ends: 243 [2025-03-03 21:36:42,549 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 21:36:42,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:36:42,550 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 101 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:36:42,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 171 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:36:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 21:36:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 71. [2025-03-03 21:36:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 21:36:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2025-03-03 21:36:42,559 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 129 [2025-03-03 21:36:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:36:42,559 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2025-03-03 21:36:42,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 21:36:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2025-03-03 21:36:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 21:36:42,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:36:42,562 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:36:42,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 21:36:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:42,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:36:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:36:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1765108625, now seen corresponding path program 1 times [2025-03-03 21:36:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:36:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344856320] [2025-03-03 21:36:42,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:36:42,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:36:42,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:36:42,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:36:42,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 21:36:42,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 21:36:43,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 21:36:43,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:36:43,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:36:43,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 21:36:43,792 INFO L279 TraceCheckSpWp]: Computing forward predicates...