./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.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 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:12:11,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:12:11,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:12:11,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:12:11,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:12:11,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:12:11,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:12:11,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:12:11,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:12:11,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:12:11,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:12:11,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:12:11,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:12:11,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:12:11,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:12:11,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:12:11,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:11,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:12:11,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:12:11,407 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 -> 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 [2025-03-08 12:12:11,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:12:11,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:12:11,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:12:11,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:12:11,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:12:11,690 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-pr-ci_file-17.i [2025-03-08 12:12:12,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e890c072e/8dc0a1609bc94733867b6581377b2acd/FLAG8a82ed03c [2025-03-08 12:12:13,164 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:12:13,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-08 12:12:13,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e890c072e/8dc0a1609bc94733867b6581377b2acd/FLAG8a82ed03c [2025-03-08 12:12:13,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e890c072e/8dc0a1609bc94733867b6581377b2acd [2025-03-08 12:12:13,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:12:13,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:12:13,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:13,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:12:13,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:12:13,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcf864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13, skipping insertion in model container [2025-03-08 12:12:13,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:12:13,596 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-pr-ci_file-17.i[919,932] [2025-03-08 12:12:13,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:13,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:12:13,660 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-pr-ci_file-17.i[919,932] [2025-03-08 12:12:13,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:13,695 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:12:13,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13 WrapperNode [2025-03-08 12:12:13,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:13,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:13,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:12:13,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:12:13,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,732 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2025-03-08 12:12:13,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:13,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:12:13,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:12:13,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:12:13,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,772 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:12:13,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:12:13,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:12:13,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:12:13,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:12:13,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (1/1) ... [2025-03-08 12:12:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:13,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:12:13,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:12:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:12:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:12:13,910 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:12:13,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:12:14,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: havoc property_#t~ite20#1;havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short21#1; [2025-03-08 12:12:14,243 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 12:12:14,243 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:12:14,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:12:14,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:12:14,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:14 BoogieIcfgContainer [2025-03-08 12:12:14,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:12:14,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:12:14,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:12:14,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:12:14,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:12:13" (1/3) ... [2025-03-08 12:12:14,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9435ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:14, skipping insertion in model container [2025-03-08 12:12:14,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:13" (2/3) ... [2025-03-08 12:12:14,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9435ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:14, skipping insertion in model container [2025-03-08 12:12:14,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:14" (3/3) ... [2025-03-08 12:12:14,269 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-08 12:12:14,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:12:14,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:12:14,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:12:14,338 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;@1158ef44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:12:14,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:12:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 12:12:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 12:12:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:14,351 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:14,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1670680911, now seen corresponding path program 1 times [2025-03-08 12:12:14,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:14,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090335434] [2025-03-08 12:12:14,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:14,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:14,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 12:12:14,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 12:12:14,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:14,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 12:12:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:14,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090335434] [2025-03-08 12:12:14,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090335434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:12:14,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774464716] [2025-03-08 12:12:14,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:14,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:14,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:14,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:12:14,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 12:12:14,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 12:12:14,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:14,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:14,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:12:14,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 12:12:14,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:12:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774464716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:14,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:12:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:12:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68281610] [2025-03-08 12:12:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:12:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:14,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:12:14,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:12:14,814 INFO L87 Difference]: Start difference. First operand has 93 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 12:12:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:14,840 INFO L93 Difference]: Finished difference Result 180 states and 305 transitions. [2025-03-08 12:12:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:12:14,842 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2025-03-08 12:12:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:14,847 INFO L225 Difference]: With dead ends: 180 [2025-03-08 12:12:14,848 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 12:12:14,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:12:14,852 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:14,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:12:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 12:12:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-08 12:12:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 12:12:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2025-03-08 12:12:14,880 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 140 [2025-03-08 12:12:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2025-03-08 12:12:14,881 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 12:12:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2025-03-08 12:12:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 12:12:14,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:14,884 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:14,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:12:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:12:15,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash -9650605, now seen corresponding path program 1 times [2025-03-08 12:12:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564622394] [2025-03-08 12:12:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:15,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 12:12:15,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 12:12:15,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:15,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 12:12:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564622394] [2025-03-08 12:12:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564622394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:12:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986347212] [2025-03-08 12:12:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:15,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:12:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:15,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:12:15,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:12:15,413 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:15,632 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2025-03-08 12:12:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:12:15,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-08 12:12:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:15,635 INFO L225 Difference]: With dead ends: 320 [2025-03-08 12:12:15,636 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 12:12:15,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:12:15,637 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:15,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 463 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:12:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 12:12:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 228. [2025-03-08 12:12:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 180 states have (on average 1.5) internal successors, (270), 181 states have internal predecessors, (270), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 12:12:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 358 transitions. [2025-03-08 12:12:15,666 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 358 transitions. Word has length 140 [2025-03-08 12:12:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:15,667 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 358 transitions. [2025-03-08 12:12:15,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 358 transitions. [2025-03-08 12:12:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 12:12:15,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:15,669 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:15,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:12:15,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1806601964, now seen corresponding path program 1 times [2025-03-08 12:12:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:15,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099072348] [2025-03-08 12:12:15,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:15,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 12:12:15,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 12:12:15,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:15,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 12:12:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099072348] [2025-03-08 12:12:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099072348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:16,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:12:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833692667] [2025-03-08 12:12:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:16,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:12:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:12:16,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:12:16,023 INFO L87 Difference]: Start difference. First operand 228 states and 358 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:16,191 INFO L93 Difference]: Finished difference Result 622 states and 976 transitions. [2025-03-08 12:12:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:12:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-08 12:12:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:16,197 INFO L225 Difference]: With dead ends: 622 [2025-03-08 12:12:16,197 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 12:12:16,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:12:16,199 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 102 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:16,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 465 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:12:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 12:12:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 271. [2025-03-08 12:12:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 202 states have internal predecessors, (291), 64 states have call successors, (64), 5 states have call predecessors, (64), 5 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:12:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2025-03-08 12:12:16,238 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 140 [2025-03-08 12:12:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:16,240 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2025-03-08 12:12:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2025-03-08 12:12:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 12:12:16,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:16,242 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:12:16,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:16,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash 252538953, now seen corresponding path program 1 times [2025-03-08 12:12:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:16,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678308354] [2025-03-08 12:12:16,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:16,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 12:12:16,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 12:12:16,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:16,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 12:12:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:12:16,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678308354] [2025-03-08 12:12:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678308354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:12:16,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131394063] [2025-03-08 12:12:16,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:16,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:16,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:12:16,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 12:12:16,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 12:12:16,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:16,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:16,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:12:16,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-08 12:12:16,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:12:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 12:12:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131394063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:12:16,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:12:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 12:12:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666519002] [2025-03-08 12:12:16,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:12:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:12:16,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:12:16,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:12:16,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:12:16,841 INFO L87 Difference]: Start difference. First operand 271 states and 419 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 12:12:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:17,064 INFO L93 Difference]: Finished difference Result 503 states and 766 transitions. [2025-03-08 12:12:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:12:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 141 [2025-03-08 12:12:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:17,068 INFO L225 Difference]: With dead ends: 503 [2025-03-08 12:12:17,069 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 12:12:17,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:12:17,070 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 317 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:17,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 245 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:12:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 12:12:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2025-03-08 12:12:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 196 states have internal predecessors, (267), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:12:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 395 transitions. [2025-03-08 12:12:17,107 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 395 transitions. Word has length 141 [2025-03-08 12:12:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:17,108 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 395 transitions. [2025-03-08 12:12:17,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 12:12:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 395 transitions. [2025-03-08 12:12:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 12:12:17,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:17,110 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:17,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:12:17,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 12:12:17,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:17,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash 895070493, now seen corresponding path program 1 times [2025-03-08 12:12:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:12:17,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312831934] [2025-03-08 12:12:17,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:17,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:12:17,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 12:12:17,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 12:12:17,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:17,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:12:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962572633] [2025-03-08 12:12:17,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:17,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:12:17,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:12:17,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 12:12:17,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 12:12:17,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:17,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:12:17,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:12:17,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 12:12:17,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 12:12:17,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:17,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:12:17,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:12:17,624 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:12:17,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:12:17,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:12:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:12:17,832 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 12:12:17,904 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:12:17,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:12:17 BoogieIcfgContainer [2025-03-08 12:12:17,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:12:17,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:12:17,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:12:17,907 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:12:17,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:14" (3/4) ... [2025-03-08 12:12:17,909 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:12:17,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:12:17,910 INFO L158 Benchmark]: Toolchain (without parser) took 4434.32ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 113.1MB in the beginning and 74.8MB in the end (delta: 38.3MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2025-03-08 12:12:17,911 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:17,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.58ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 97.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:12:17,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.45ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 93.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:17,911 INFO L158 Benchmark]: Boogie Preprocessor took 58.68ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 88.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:12:17,912 INFO L158 Benchmark]: IcfgBuilder took 465.49ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 57.8MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:12:17,913 INFO L158 Benchmark]: TraceAbstraction took 3643.63ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 56.9MB in the beginning and 74.8MB in the end (delta: -17.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-08 12:12:17,913 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 184.5MB. Free memory was 74.8MB in the beginning and 74.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:12:17,914 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.86ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.58ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 97.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.45ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 93.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.68ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 88.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 465.49ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 57.8MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3643.63ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 56.9MB in the beginning and 74.8MB in the end (delta: -17.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 184.5MB. Free memory was 74.8MB in the beginning and 74.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] signed short int var_1_23 = -10; [L41] unsigned long int var_1_30 = 1000000000; [L42] float var_1_33 = 99.25; [L43] signed long int var_1_34 = 10; [L44] unsigned char var_1_35 = 16; [L45] signed long int var_1_39 = -128; [L46] signed long int var_1_40 = 1792665454; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L177] isInitial = 1 [L178] FCALL initially() [L179] COND TRUE 1 [L180] CALL updateLastVariables() [L169] last_1_var_1_8 = var_1_8 [L170] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L180] RET updateLastVariables() [L181] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L137] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L139] var_1_3 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] var_1_4 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] var_1_7 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L156] var_1_13 = __VERIFIER_nondet_double() [L157] 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_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] 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_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L161] var_1_19 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] var_1_40 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L181] RET updateVariables() [L182] CALL step() [L52] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L53] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L54] COND TRUE \read(last_1_var_1_8) [L55] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND TRUE var_1_5 < var_1_3 [L61] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L65] COND TRUE \read(var_1_7) [L66] var_1_34 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L68] EXPR var_1_4 >> var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L68] COND FALSE !(var_1_4 > (var_1_4 >> var_1_4)) [L75] var_1_39 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L77] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L78] COND TRUE 128u <= var_1_19 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L79] COND FALSE !((var_1_12 >= var_1_12) && ((var_1_19 * var_1_15) < ((((var_1_1) < (var_1_19)) ? (var_1_1) : (var_1_19))))) [L90] var_1_23 = 5 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L93] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L98] COND TRUE var_1_1 >= var_1_14 [L99] var_1_30 = (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) - var_1_2) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L101] COND TRUE var_1_19 > var_1_3 [L102] var_1_35 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L110] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L111] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L112] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L116] var_1_20 = ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13))) [L117] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L118] COND FALSE !(var_1_4 == stepLocal_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L121] var_1_33 = var_1_12 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L122] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L122] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L123] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L182] RET step() [L183] CALL, EXPR property() [L173] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L173-L174] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L183] RET, EXPR property() [L183] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 165 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 1309 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 479 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 141 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 976 ConstructedInterpolants, 0 QuantifiedInterpolants, 1518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5255/5320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:12:17,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.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 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:12:19,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:12:19,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:12:19,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:12:19,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:12:19,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:12:19,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:12:19,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:12:19,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:12:19,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:12:19,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:12:19,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:12:19,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:19,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:12:19,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:12:19,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:12:19,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:12:19,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:12:19,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:12:19,788 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 -> 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 [2025-03-08 12:12:20,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:12:20,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:12:20,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:12:20,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:12:20,026 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:12:20,027 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-pr-ci_file-17.i [2025-03-08 12:12:21,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94059c343/0fd99724120942939626b54ee39cd895/FLAG34cf82197 [2025-03-08 12:12:21,416 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:12:21,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-08 12:12:21,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94059c343/0fd99724120942939626b54ee39cd895/FLAG34cf82197 [2025-03-08 12:12:21,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94059c343/0fd99724120942939626b54ee39cd895 [2025-03-08 12:12:21,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:12:21,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:12:21,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:21,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:12:21,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:12:21,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d747508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21, skipping insertion in model container [2025-03-08 12:12:21,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:12:21,574 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-pr-ci_file-17.i[919,932] [2025-03-08 12:12:21,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:21,646 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:12:21,654 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-pr-ci_file-17.i[919,932] [2025-03-08 12:12:21,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:12:21,695 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:12:21,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21 WrapperNode [2025-03-08 12:12:21,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:12:21,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:21,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:12:21,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:12:21,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,739 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-08 12:12:21,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:12:21,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:12:21,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:12:21,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:12:21,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:12:21,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:12:21,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:12:21,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:12:21,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:12:21,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (1/1) ... [2025-03-08 12:12:21,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:12:21,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:12:21,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:12:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:12:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:12:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:12:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:12:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:12:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:12:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:12:21,924 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:12:21,926 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:12:22,717 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:12:22,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:12:22,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:12:22,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:12:22,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:22 BoogieIcfgContainer [2025-03-08 12:12:22,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:12:22,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:12:22,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:12:22,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:12:22,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:12:21" (1/3) ... [2025-03-08 12:12:22,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5293227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:22, skipping insertion in model container [2025-03-08 12:12:22,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:12:21" (2/3) ... [2025-03-08 12:12:22,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5293227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:12:22, skipping insertion in model container [2025-03-08 12:12:22,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:12:22" (3/3) ... [2025-03-08 12:12:22,736 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-08 12:12:22,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:12:22,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:12:22,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:12:22,798 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;@72a00d45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:12:22,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:12:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 12:12:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 12:12:22,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:22,812 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:22,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:22,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash -829703, now seen corresponding path program 1 times [2025-03-08 12:12:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:12:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081594668] [2025-03-08 12:12:22,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:22,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:12:22,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:12:22,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:12:22,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:12:23,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:12:23,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:23,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:12:23,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 12:12:23,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:12:23,471 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:12:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081594668] [2025-03-08 12:12:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081594668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:23,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:12:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600822746] [2025-03-08 12:12:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:23,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:12:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:12:23,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:12:23,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:12:23,489 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:24,081 INFO L93 Difference]: Finished difference Result 211 states and 380 transitions. [2025-03-08 12:12:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:12:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-03-08 12:12:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:24,096 INFO L225 Difference]: With dead ends: 211 [2025-03-08 12:12:24,096 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 12:12:24,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:12:24,101 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 70 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:24,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 366 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:12:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 12:12:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2025-03-08 12:12:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 12:12:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2025-03-08 12:12:24,140 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 135 [2025-03-08 12:12:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:24,141 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2025-03-08 12:12:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2025-03-08 12:12:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 12:12:24,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:24,143 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:24,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:12:24,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:24,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash -227027706, now seen corresponding path program 1 times [2025-03-08 12:12:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:12:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326155163] [2025-03-08 12:12:24,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:12:24,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:12:24,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:12:24,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 12:12:24,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 12:12:24,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:24,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:24,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:12:24,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-08 12:12:24,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:12:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 12:12:24,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:12:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326155163] [2025-03-08 12:12:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326155163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:12:24,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:12:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 12:12:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976706633] [2025-03-08 12:12:24,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:12:24,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:12:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:12:24,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:12:24,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:12:24,855 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-08 12:12:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:25,365 INFO L93 Difference]: Finished difference Result 188 states and 283 transitions. [2025-03-08 12:12:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:12:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 136 [2025-03-08 12:12:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:25,375 INFO L225 Difference]: With dead ends: 188 [2025-03-08 12:12:25,375 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 12:12:25,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:12:25,376 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:25,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 185 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:12:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 12:12:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-03-08 12:12:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 12:12:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2025-03-08 12:12:25,398 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 136 [2025-03-08 12:12:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2025-03-08 12:12:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-08 12:12:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2025-03-08 12:12:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 12:12:25,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:25,400 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:25,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:12:25,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:25,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1951588410, now seen corresponding path program 1 times [2025-03-08 12:12:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:12:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145622931] [2025-03-08 12:12:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:25,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:25,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:12:25,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:12:25,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:12:25,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 12:12:25,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 12:12:25,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:25,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:25,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:12:25,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 12:12:26,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:12:26,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:12:26,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145622931] [2025-03-08 12:12:26,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145622931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:26,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:12:26,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:12:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870072907] [2025-03-08 12:12:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:26,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:12:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:12:26,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:12:26,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:26,055 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:26,378 INFO L93 Difference]: Finished difference Result 256 states and 379 transitions. [2025-03-08 12:12:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:12:26,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-08 12:12:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:26,380 INFO L225 Difference]: With dead ends: 256 [2025-03-08 12:12:26,380 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 12:12:26,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:12:26,381 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:26,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:12:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 12:12:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2025-03-08 12:12:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 117 states have internal predecessors, (152), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:12:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2025-03-08 12:12:26,418 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 137 [2025-03-08 12:12:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:26,420 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2025-03-08 12:12:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2025-03-08 12:12:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 12:12:26,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:26,423 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:26,431 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-08 12:12:26,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:26,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:26,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1822505691, now seen corresponding path program 1 times [2025-03-08 12:12:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:12:26,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238472822] [2025-03-08 12:12:26,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:26,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:12:26,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:12:26,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 12:12:26,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 12:12:26,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 12:12:26,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:26,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:26,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:12:26,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 309 proven. 42 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-03-08 12:12:27,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:12:27,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:12:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238472822] [2025-03-08 12:12:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238472822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:12:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1619323086] [2025-03-08 12:12:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:12:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:12:27,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:12:27,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 12:12:27,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 12:12:28,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 12:12:28,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:28,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:28,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:12:28,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:12:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 12:12:28,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:12:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1619323086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:12:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:12:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2025-03-08 12:12:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547894101] [2025-03-08 12:12:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:12:28,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:12:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:12:28,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:12:28,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:12:28,407 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:12:29,270 INFO L93 Difference]: Finished difference Result 363 states and 532 transitions. [2025-03-08 12:12:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:12:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-08 12:12:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:12:29,272 INFO L225 Difference]: With dead ends: 363 [2025-03-08 12:12:29,272 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 12:12:29,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:12:29,274 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:12:29,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 337 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:12:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 12:12:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2025-03-08 12:12:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 148 states have internal predecessors, (191), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:12:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2025-03-08 12:12:29,295 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 137 [2025-03-08 12:12:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:12:29,296 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2025-03-08 12:12:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 12:12:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2025-03-08 12:12:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 12:12:29,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:12:29,297 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:12:29,305 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 (5)] Ended with exit code 0 [2025-03-08 12:12:29,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-08 12:12:29,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 12:12:29,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:12:29,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:12:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1584957924, now seen corresponding path program 1 times [2025-03-08 12:12:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:12:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590274330] [2025-03-08 12:12:29,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:12:29,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:12:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:12:29,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:12:29,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 12:12:29,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 12:12:29,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 12:12:29,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:12:29,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:12:29,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 12:12:29,856 INFO L279 TraceCheckSpWp]: Computing forward predicates...