./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.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 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:37:43,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:37:43,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:37:43,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:37:43,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:37:43,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:37:43,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:37:43,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:37:43,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:37:43,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:37:43,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:37:43,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:37:43,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:37:43,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:37:43,419 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:37:43,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:37:43,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:37:43,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:37:43,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:37:43,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:37:43,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:37:43,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:37:43,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:37:43,422 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 -> 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 [2025-03-03 21:37:43,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:37:43,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:37:43,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:37:43,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:37:43,674 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:37:43,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-03-03 21:37:44,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2ac237b/5a874473a90847b2849daef104200495/FLAGbf4b81cc1 [2025-03-03 21:37:45,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:37:45,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-03-03 21:37:45,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2ac237b/5a874473a90847b2849daef104200495/FLAGbf4b81cc1 [2025-03-03 21:37:45,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2ac237b/5a874473a90847b2849daef104200495 [2025-03-03 21:37:45,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:37:45,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:37:45,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:37:45,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:37:45,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:37:45,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45, skipping insertion in model container [2025-03-03 21:37:45,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:37:45,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-03-03 21:37:45,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:37:45,573 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:37:45,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-03-03 21:37:45,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:37:45,614 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:37:45,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45 WrapperNode [2025-03-03 21:37:45,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:37:45,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:37:45,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:37:45,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:37:45,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,655 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2025-03-03 21:37:45,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:37:45,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:37:45,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:37:45,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:37:45,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,683 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:37:45,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:37:45,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:37:45,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:37:45,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:37:45,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (1/1) ... [2025-03-03 21:37:45,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:37:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:37:45,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:37:45,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:37:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:37:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:37:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:37:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:37:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:37:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:37:45,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:37:45,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:37:46,136 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:37:46,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:37:46,150 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:37:46,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:37:46,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:46 BoogieIcfgContainer [2025-03-03 21:37:46,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:37:46,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:37:46,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:37:46,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:37:46,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:37:45" (1/3) ... [2025-03-03 21:37:46,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa1e956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:37:46, skipping insertion in model container [2025-03-03 21:37:46,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:45" (2/3) ... [2025-03-03 21:37:46,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa1e956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:37:46, skipping insertion in model container [2025-03-03 21:37:46,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:46" (3/3) ... [2025-03-03 21:37:46,161 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-03-03 21:37:46,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:37:46,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:37:46,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:37:46,229 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;@2856d0d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:37:46,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:37:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:37:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:37:46,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:46,242 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:46,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:46,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1666625040, now seen corresponding path program 1 times [2025-03-03 21:37:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:46,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966334517] [2025-03-03 21:37:46,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:46,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:46,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:37:46,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:37:46,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 21:37:46,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:46,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966334517] [2025-03-03 21:37:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966334517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:37:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444786164] [2025-03-03 21:37:46,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:37:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:37:46,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:37:46,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:37:46,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:37:46,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:37:46,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:46,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:46,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:37:46,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:37:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 21:37:46,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:37:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444786164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:46,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:37:46,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:37:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113861767] [2025-03-03 21:37:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:46,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:37:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:46,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:37:46,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:37:46,711 INFO L87 Difference]: Start difference. First operand has 96 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:37:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:46,737 INFO L93 Difference]: Finished difference Result 186 states and 327 transitions. [2025-03-03 21:37:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:37:46,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2025-03-03 21:37:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:46,743 INFO L225 Difference]: With dead ends: 186 [2025-03-03 21:37:46,743 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 21:37:46,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:37:46,750 INFO L435 NwaCegarLoop]: 141 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, 141 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-03 21:37:46,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 21:37:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 21:37:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:37:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2025-03-03 21:37:46,781 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 175 [2025-03-03 21:37:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:46,782 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2025-03-03 21:37:46,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:37:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2025-03-03 21:37:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:37:46,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:46,784 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:46,790 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-03 21:37:46,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:37:46,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1329625618, now seen corresponding path program 1 times [2025-03-03 21:37:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916121710] [2025-03-03 21:37:46,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:46,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:47,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:37:47,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:37:47,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:47,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:37:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916121710] [2025-03-03 21:37:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916121710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:37:47,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543679263] [2025-03-03 21:37:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:37:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:47,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:37:47,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:47,300 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:47,377 INFO L93 Difference]: Finished difference Result 264 states and 418 transitions. [2025-03-03 21:37:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:37:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 21:37:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:47,380 INFO L225 Difference]: With dead ends: 264 [2025-03-03 21:37:47,381 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 21:37:47,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:47,382 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 80 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:47,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 260 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 21:37:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2025-03-03 21:37:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:37:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 227 transitions. [2025-03-03 21:37:47,412 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 227 transitions. Word has length 175 [2025-03-03 21:37:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:47,413 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 227 transitions. [2025-03-03 21:37:47,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 227 transitions. [2025-03-03 21:37:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:37:47,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:47,416 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:47,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:37:47,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1118274705, now seen corresponding path program 1 times [2025-03-03 21:37:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:47,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013650061] [2025-03-03 21:37:47,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:47,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:37:47,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:37:47,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:37:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013650061] [2025-03-03 21:37:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013650061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:37:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675606855] [2025-03-03 21:37:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:37:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:47,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:37:47,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:47,511 INFO L87 Difference]: Start difference. First operand 146 states and 227 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:47,569 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2025-03-03 21:37:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:37:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 21:37:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:47,571 INFO L225 Difference]: With dead ends: 278 [2025-03-03 21:37:47,571 INFO L226 Difference]: Without dead ends: 188 [2025-03-03 21:37:47,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:47,573 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 57 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:47,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 285 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-03 21:37:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2025-03-03 21:37:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 119 states have internal predecessors, (157), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:37:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2025-03-03 21:37:47,592 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 175 [2025-03-03 21:37:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2025-03-03 21:37:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2025-03-03 21:37:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 21:37:47,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:47,594 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:37:47,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1623833330, now seen corresponding path program 1 times [2025-03-03 21:37:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561765446] [2025-03-03 21:37:47,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 21:37:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 21:37:47,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:47,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:37:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561765446] [2025-03-03 21:37:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561765446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:37:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915444307] [2025-03-03 21:37:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:37:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:47,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:37:47,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:47,735 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:47,812 INFO L93 Difference]: Finished difference Result 374 states and 574 transitions. [2025-03-03 21:37:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:37:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 21:37:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:47,817 INFO L225 Difference]: With dead ends: 374 [2025-03-03 21:37:47,817 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 21:37:47,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:47,820 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:47,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 282 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:37:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 21:37:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2025-03-03 21:37:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 163 states have internal predecessors, (229), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:37:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 353 transitions. [2025-03-03 21:37:47,848 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 353 transitions. Word has length 175 [2025-03-03 21:37:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:47,848 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 353 transitions. [2025-03-03 21:37:47,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2025-03-03 21:37:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 21:37:47,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:47,850 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:47,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:37:47,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:47,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash -13654181, now seen corresponding path program 1 times [2025-03-03 21:37:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:47,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937677039] [2025-03-03 21:37:47,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:47,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 21:37:47,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 21:37:47,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:47,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:37:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937677039] [2025-03-03 21:37:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937677039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:48,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:37:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116557893] [2025-03-03 21:37:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:48,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:37:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:48,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:37:48,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:48,102 INFO L87 Difference]: Start difference. First operand 229 states and 353 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:48,158 INFO L93 Difference]: Finished difference Result 450 states and 702 transitions. [2025-03-03 21:37:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:37:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-03-03 21:37:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:48,161 INFO L225 Difference]: With dead ends: 450 [2025-03-03 21:37:48,161 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 21:37:48,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:48,172 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 72 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:48,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 256 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 21:37:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 231. [2025-03-03 21:37:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 164 states have (on average 1.4085365853658536) internal successors, (231), 165 states have internal predecessors, (231), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:37:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 355 transitions. [2025-03-03 21:37:48,199 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 355 transitions. Word has length 176 [2025-03-03 21:37:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:48,200 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 355 transitions. [2025-03-03 21:37:48,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 355 transitions. [2025-03-03 21:37:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 21:37:48,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:48,202 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:37:48,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash -819012792, now seen corresponding path program 1 times [2025-03-03 21:37:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596731802] [2025-03-03 21:37:48,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 21:37:48,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 21:37:48,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:48,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:37:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596731802] [2025-03-03 21:37:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596731802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:48,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:37:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686272128] [2025-03-03 21:37:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:48,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:37:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:48,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:37:48,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:37:48,352 INFO L87 Difference]: Start difference. First operand 231 states and 355 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:48,437 INFO L93 Difference]: Finished difference Result 569 states and 885 transitions. [2025-03-03 21:37:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:37:48,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-03-03 21:37:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:48,440 INFO L225 Difference]: With dead ends: 569 [2025-03-03 21:37:48,440 INFO L226 Difference]: Without dead ends: 404 [2025-03-03 21:37:48,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:37:48,444 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 100 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:48,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 383 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-03 21:37:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2025-03-03 21:37:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 291 states have (on average 1.436426116838488) internal successors, (418), 293 states have internal predecessors, (418), 98 states have call successors, (98), 6 states have call predecessors, (98), 6 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 21:37:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 614 transitions. [2025-03-03 21:37:48,481 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 614 transitions. Word has length 177 [2025-03-03 21:37:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:48,483 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 614 transitions. [2025-03-03 21:37:48,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 614 transitions. [2025-03-03 21:37:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 21:37:48,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:48,485 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:48,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:37:48,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:48,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1098903943, now seen corresponding path program 1 times [2025-03-03 21:37:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:48,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785098489] [2025-03-03 21:37:48,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:48,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 21:37:48,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 21:37:48,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:48,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:37:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785098489] [2025-03-03 21:37:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785098489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:48,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:48,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:37:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868644085] [2025-03-03 21:37:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:48,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:37:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:48,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:37:48,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:48,656 INFO L87 Difference]: Start difference. First operand 396 states and 614 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:48,719 INFO L93 Difference]: Finished difference Result 780 states and 1218 transitions. [2025-03-03 21:37:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:37:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-03-03 21:37:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:48,722 INFO L225 Difference]: With dead ends: 780 [2025-03-03 21:37:48,725 INFO L226 Difference]: Without dead ends: 450 [2025-03-03 21:37:48,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:37:48,726 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 70 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:48,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 257 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-03 21:37:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 398. [2025-03-03 21:37:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 293 states have (on average 1.4334470989761092) internal successors, (420), 295 states have internal predecessors, (420), 98 states have call successors, (98), 6 states have call predecessors, (98), 6 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 21:37:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 616 transitions. [2025-03-03 21:37:48,767 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 616 transitions. Word has length 178 [2025-03-03 21:37:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:48,768 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 616 transitions. [2025-03-03 21:37:48,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:37:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 616 transitions. [2025-03-03 21:37:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 21:37:48,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:48,771 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:48,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:37:48,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1225024319, now seen corresponding path program 1 times [2025-03-03 21:37:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992855078] [2025-03-03 21:37:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:48,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 21:37:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 21:37:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:37:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490770304] [2025-03-03 21:37:48,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:48,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:37:48,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:37:48,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:37:48,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:37:48,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 21:37:49,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 21:37:49,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:49,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:37:49,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:37:49,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 21:37:49,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 21:37:49,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:37:49,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:37:49,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:37:49,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:37:49,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:37:49,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 21:37:49,426 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:49,539 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:37:49,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:37:49 BoogieIcfgContainer [2025-03-03 21:37:49,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:37:49,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:37:49,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:37:49,542 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:37:49,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:46" (3/4) ... [2025-03-03 21:37:49,547 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:37:49,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:37:49,548 INFO L158 Benchmark]: Toolchain (without parser) took 4134.63ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.6MB in the beginning and 98.2MB in the end (delta: 14.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-03 21:37:49,548 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:37:49,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.49ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:37:49,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 92.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:37:49,549 INFO L158 Benchmark]: Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 86.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:37:49,549 INFO L158 Benchmark]: IcfgBuilder took 448.90ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 56.3MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 21:37:49,549 INFO L158 Benchmark]: TraceAbstraction took 3387.01ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 55.4MB in the beginning and 98.2MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:37:49,549 INFO L158 Benchmark]: Witness Printer took 5.70ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 98.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:37:49,550 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.49ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 92.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 86.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 448.90ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 56.3MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3387.01ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 55.4MB in the beginning and 98.2MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.70ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 98.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of bitwiseAnd at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed long int var_1_27 = 32; [L43] unsigned char var_1_28 = 64; [L44] signed char var_1_29 = 100; [L45] signed char var_1_30 = -1; [L46] signed char var_1_31 = 10; [L47] signed char var_1_32 = 5; [L48] signed char var_1_33 = 1; [L49] unsigned short int var_1_34 = 32; [L50] signed long int var_1_36 = -8; [L51] float last_1_var_1_10 = 7.25; [L52] double last_1_var_1_13 = 0.9; [L53] unsigned short int last_1_var_1_17 = 8; [L54] signed char last_1_var_1_19 = -128; VAL [isInitial=0, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_10 = var_1_10 [L177] last_1_var_1_13 = var_1_13 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L134] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L136] var_1_3 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_8 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L142] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=513/2] [L142] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=513/2] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L144] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L145] var_1_12 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L146] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L147] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L147] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L150] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L150] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L151] var_1_15 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L152] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L153] var_1_16 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L154] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L155] var_1_18 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L156] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L157] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L157] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L158] var_1_20 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L159] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L160] var_1_21 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L161] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L162] var_1_22 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L163] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L164] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L164] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L165] var_1_30 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L166] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L167] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L167] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L168] var_1_31 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L169] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L170] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L170] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L172] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L190] RET updateVariables() [L191] CALL step() [L58] COND TRUE (~ (- var_1_3)) < var_1_2 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L59] COND FALSE !(var_1_2 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L63] COND TRUE var_1_8 > var_1_19 [L64] var_1_27 = ((((var_1_8) > (var_1_22)) ? (var_1_8) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L66] COND TRUE var_1_17 <= (((((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) < 0 ) ? -((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) : ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) [L67] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L69] COND TRUE var_1_12 <= 16 [L70] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L72] COND FALSE !(var_1_11 >= var_1_1) [L75] var_1_32 = var_1_22 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] EXPR var_1_17 & var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] EXPR (var_1_17 & var_1_11) ^ var_1_12 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] EXPR var_1_19 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L77] COND FALSE !(((var_1_17 & var_1_11) ^ var_1_12) < (var_1_19 & var_1_33)) [L82] EXPR var_1_3 & (~ var_1_17) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L82] COND TRUE (var_1_3 & (~ var_1_17)) <= var_1_3 [L83] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L91] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L92] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=-128, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L103] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L104] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L108] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3] [L109] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L110] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L112] COND FALSE !(var_1_10 >= var_1_10) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=256, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L117] COND TRUE (var_1_2 - var_1_3) > var_1_17 [L118] var_1_1 = (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L122] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L123] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_1=32, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L124] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=16, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=32767, var_1_19=97, var_1_1=64, var_1_22=97, var_1_23=50, var_1_27=97, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=97, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 1864 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 869 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 995 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 165 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1762 NumberOfCodeBlocks, 1762 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1398 ConstructedInterpolants, 0 QuantifiedInterpolants, 3704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 10350/10400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:37:49,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.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 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:37:51,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:37:51,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:37:51,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:37:51,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:37:51,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:37:51,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:37:51,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:37:51,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:37:51,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:37:51,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:37:51,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:37:51,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:37:51,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:37:51,484 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:37:51,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:37:51,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:37:51,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:37:51,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:37:51,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:37:51,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:37:51,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:37:51,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:37:51,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:37:51,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:37:51,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:37:51,487 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 -> 3df77670afa39ace423f8f8369d847156a56fccf6b4e9eb57830fd07cb1fc0f9 [2025-03-03 21:37:51,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:37:51,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:37:51,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:37:51,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:37:51,726 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:37:51,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-03-03 21:37:52,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f72eb38/24ffd5ae884a4a9b80991147f89968b9/FLAGc482ff48d [2025-03-03 21:37:53,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:37:53,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-03-03 21:37:53,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f72eb38/24ffd5ae884a4a9b80991147f89968b9/FLAGc482ff48d [2025-03-03 21:37:53,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f72eb38/24ffd5ae884a4a9b80991147f89968b9 [2025-03-03 21:37:53,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:37:53,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:37:53,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:37:53,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:37:53,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:37:53,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16936fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53, skipping insertion in model container [2025-03-03 21:37:53,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:37:53,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-03-03 21:37:53,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:37:53,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:37:53,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i[919,932] [2025-03-03 21:37:53,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:37:53,386 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:37:53,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53 WrapperNode [2025-03-03 21:37:53,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:37:53,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:37:53,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:37:53,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:37:53,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,429 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-03 21:37:53,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:37:53,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:37:53,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:37:53,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:37:53,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:37:53,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:37:53,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:37:53,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:37:53,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:37:53,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (1/1) ... [2025-03-03 21:37:53,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:37:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:37:53,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:37:53,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:37:53,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:37:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:37:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:37:53,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:37:53,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:37:53,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:37:53,582 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:37:53,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:38:05,887 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:38:05,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:38:05,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:38:05,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:38:05,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:38:05 BoogieIcfgContainer [2025-03-03 21:38:05,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:38:05,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:38:05,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:38:05,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:38:05,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:37:53" (1/3) ... [2025-03-03 21:38:05,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48345b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:38:05, skipping insertion in model container [2025-03-03 21:38:05,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:53" (2/3) ... [2025-03-03 21:38:05,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48345b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:38:05, skipping insertion in model container [2025-03-03 21:38:05,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:38:05" (3/3) ... [2025-03-03 21:38:05,902 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i [2025-03-03 21:38:05,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:38:05,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-37.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:38:05,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:38:05,967 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;@6510743d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:38:05,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:38:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:38:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 21:38:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:05,980 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:05,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1484212771, now seen corresponding path program 1 times [2025-03-03 21:38:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:38:05,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396524388] [2025-03-03 21:38:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:38:05,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:38:05,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:38:06,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:38:06,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:38:06,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:06,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:38:06,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:38:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-03 21:38:06,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:38:06,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:38:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396524388] [2025-03-03 21:38:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396524388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:38:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116157] [2025-03-03 21:38:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:06,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:38:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:38:06,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:38:06,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:38:06,592 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:38:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:06,618 INFO L93 Difference]: Finished difference Result 159 states and 281 transitions. [2025-03-03 21:38:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:38:06,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-03-03 21:38:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:06,626 INFO L225 Difference]: With dead ends: 159 [2025-03-03 21:38:06,626 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 21:38:06,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:38:06,630 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:06,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:38:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 21:38:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 21:38:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:38:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-03-03 21:38:06,668 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 171 [2025-03-03 21:38:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:06,669 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-03-03 21:38:06,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:38:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-03-03 21:38:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 21:38:06,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:06,676 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:06,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:38:06,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:06,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:06,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash 577018075, now seen corresponding path program 1 times [2025-03-03 21:38:06,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:38:06,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82368595] [2025-03-03 21:38:06,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:06,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:38:06,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:38:06,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:38:06,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:38:07,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:38:07,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:07,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:07,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:38:07,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:38:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:38:11,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:38:11,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:38:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82368595] [2025-03-03 21:38:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82368595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:38:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294801500] [2025-03-03 21:38:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:11,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:38:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:38:11,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:38:11,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:38:11,221 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:38:15,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:15,544 INFO L93 Difference]: Finished difference Result 222 states and 346 transitions. [2025-03-03 21:38:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:38:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 21:38:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:15,550 INFO L225 Difference]: With dead ends: 222 [2025-03-03 21:38:15,550 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 21:38:15,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:38:15,551 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 27 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:15,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 224 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 21:38:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 21:38:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2025-03-03 21:38:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:38:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-03 21:38:15,579 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 171 [2025-03-03 21:38:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-03 21:38:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:38:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-03 21:38:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 21:38:15,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:15,583 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:15,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:38:15,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:15,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:15,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1930327772, now seen corresponding path program 1 times [2025-03-03 21:38:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:38:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611656211] [2025-03-03 21:38:15,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:15,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:38:15,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:38:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:38:15,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:38:16,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:38:16,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:16,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:16,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:38:16,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:38:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:38:16,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:38:16,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:38:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611656211] [2025-03-03 21:38:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611656211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:16,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:38:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085052435] [2025-03-03 21:38:16,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:38:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:38:16,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:38:16,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:38:16,310 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:38:20,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:24,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:24,488 INFO L93 Difference]: Finished difference Result 250 states and 378 transitions. [2025-03-03 21:38:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:38:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 21:38:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:24,531 INFO L225 Difference]: With dead ends: 250 [2025-03-03 21:38:24,531 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 21:38:24,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:38:24,533 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:24,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 246 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-03-03 21:38:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 21:38:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-03 21:38:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 105 states have internal predecessors, (133), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:38:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2025-03-03 21:38:24,546 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 171 [2025-03-03 21:38:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:24,546 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2025-03-03 21:38:24,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:38:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2025-03-03 21:38:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 21:38:24,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:24,552 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:24,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 21:38:24,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:24,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1424769147, now seen corresponding path program 1 times [2025-03-03 21:38:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:38:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373433744] [2025-03-03 21:38:24,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:24,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:24,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:38:24,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:38:24,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 21:38:24,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:38:25,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:38:25,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:25,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:25,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:38:25,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:38:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 576 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:38:32,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:38:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:38:33,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:38:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373433744] [2025-03-03 21:38:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373433744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:38:33,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:38:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-03 21:38:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880722752] [2025-03-03 21:38:33,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:38:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:38:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:38:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:38:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:38:33,720 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 21:38:39,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:42,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:44,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:48,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:52,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:56,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:38:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:56,611 INFO L93 Difference]: Finished difference Result 302 states and 443 transitions. [2025-03-03 21:38:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:38:56,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 171 [2025-03-03 21:38:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:56,664 INFO L225 Difference]: With dead ends: 302 [2025-03-03 21:38:56,664 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 21:38:56,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:38:56,665 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 313 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 193 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:56,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 179 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 176 Invalid, 3 Unknown, 0 Unchecked, 21.9s Time] [2025-03-03 21:38:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 21:38:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2025-03-03 21:38:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.238938053097345) internal successors, (140), 114 states have internal predecessors, (140), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:38:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2025-03-03 21:38:56,692 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 171 [2025-03-03 21:38:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:56,693 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2025-03-03 21:38:56,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 21:38:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2025-03-03 21:38:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:38:56,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:56,698 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:56,718 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-03 21:38:56,899 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 [2025-03-03 21:38:56,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:56,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1158800405, now seen corresponding path program 1 times [2025-03-03 21:38:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:38:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196220841] [2025-03-03 21:38:56,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:38:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:38:56,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:38:56,903 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 (6)] Waiting until timeout for monitored process [2025-03-03 21:38:56,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:38:57,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:38:57,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:57,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:57,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:38:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:38:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:38:57,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:38:57,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:38:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196220841] [2025-03-03 21:38:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196220841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:57,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:57,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:38:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533853945] [2025-03-03 21:38:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:57,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:38:57,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:38:57,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:38:57,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:38:57,418 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:39:01,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:39:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:39:01,889 INFO L93 Difference]: Finished difference Result 310 states and 443 transitions. [2025-03-03 21:39:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:39:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-03 21:39:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:39:01,891 INFO L225 Difference]: With dead ends: 310 [2025-03-03 21:39:01,891 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 21:39:01,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:39:01,892 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 35 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:39:01,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 233 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 21:39:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 21:39:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-03 21:39:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 120 states have internal predecessors, (144), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:39:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 268 transitions. [2025-03-03 21:39:01,913 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 268 transitions. Word has length 172 [2025-03-03 21:39:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:39:01,914 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 268 transitions. [2025-03-03 21:39:01,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:39:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 268 transitions. [2025-03-03 21:39:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:39:01,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:39:01,916 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:39:01,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 21:39:02,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:39:02,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:39:02,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:39:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash 584009930, now seen corresponding path program 1 times [2025-03-03 21:39:02,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:39:02,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483253883] [2025-03-03 21:39:02,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:39:02,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:39:02,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:39:02,119 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-03 21:39:02,120 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-03 21:39:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:39:02,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:39:02,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:39:02,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:39:02,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:39:02,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:39:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 232 proven. 138 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-03-03 21:39:06,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:39:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 141 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-03 21:39:08,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:39:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483253883] [2025-03-03 21:39:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483253883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:39:08,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:39:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-03 21:39:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586557999] [2025-03-03 21:39:08,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:39:08,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:39:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:39:08,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:39:08,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:39:08,105 INFO L87 Difference]: Start difference. First operand 191 states and 268 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 4 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 3 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-03 21:39:12,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:39:17,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:39:21,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []