./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-41.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_operatoramount_amount100_file-41.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 3f6a57117b69ef8d0664b771b2ca3514fdde54ed8e1d3413e00014e5fcf2fa34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:54:49,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:54:50,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:54:50,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:54:50,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:54:50,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:54:50,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:54:50,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:54:50,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:54:50,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:54:50,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:54:50,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:54:50,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:54:50,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:54:50,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:54:50,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:54:50,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:54:50,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:54:50,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:54:50,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:54:50,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:54:50,040 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 -> 3f6a57117b69ef8d0664b771b2ca3514fdde54ed8e1d3413e00014e5fcf2fa34 [2025-03-03 23:54:50,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:54:50,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:54:50,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:54:50,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:54:50,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:54:50,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-41.i [2025-03-03 23:54:51,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce718c36e/a640d9ed2e4941fb8ef6b5f338e1cb4e/FLAGafa8cab3b [2025-03-03 23:54:51,656 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:54:51,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-41.i [2025-03-03 23:54:51,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce718c36e/a640d9ed2e4941fb8ef6b5f338e1cb4e/FLAGafa8cab3b [2025-03-03 23:54:51,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce718c36e/a640d9ed2e4941fb8ef6b5f338e1cb4e [2025-03-03 23:54:51,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:54:51,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:54:51,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:54:51,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:54:51,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:54:51,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff5551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51, skipping insertion in model container [2025-03-03 23:54:51,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:54:51,809 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_operatoramount_amount100_file-41.i[916,929] [2025-03-03 23:54:51,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:54:51,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:54:51,877 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_operatoramount_amount100_file-41.i[916,929] [2025-03-03 23:54:51,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:54:51,925 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:54:51,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51 WrapperNode [2025-03-03 23:54:51,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:54:51,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:54:51,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:54:51,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:54:51,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,964 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-03-03 23:54:51,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:54:51,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:54:51,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:54:51,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:54:51,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,985 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 23:54:51,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:51,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:52,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:52,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:52,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:52,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:54:52,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:54:52,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:54:52,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:54:52,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (1/1) ... [2025-03-03 23:54:52,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:54:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:54:52,034 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 23:54:52,036 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 23:54:52,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:54:52,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:54:52,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:54:52,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:54:52,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:54:52,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:54:52,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:54:52,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:54:52,410 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-03 23:54:52,438 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 23:54:52,439 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:54:52,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:54:52,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:54:52,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:54:52 BoogieIcfgContainer [2025-03-03 23:54:52,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:54:52,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:54:52,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:54:52,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:54:52,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:54:51" (1/3) ... [2025-03-03 23:54:52,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a1b4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:54:52, skipping insertion in model container [2025-03-03 23:54:52,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:54:51" (2/3) ... [2025-03-03 23:54:52,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a1b4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:54:52, skipping insertion in model container [2025-03-03 23:54:52,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:54:52" (3/3) ... [2025-03-03 23:54:52,461 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-41.i [2025-03-03 23:54:52,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:54:52,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-41.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:54:52,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:54:52,517 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;@ae95b11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:54:52,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:54:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:54:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:54:52,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:52,529 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:54:52,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:52,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash -614170528, now seen corresponding path program 1 times [2025-03-03 23:54:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422853600] [2025-03-03 23:54:52,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:52,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:54:52,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:54:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:52,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:54:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422853600] [2025-03-03 23:54:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422853600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:53,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:54:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477406967] [2025-03-03 23:54:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:53,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:54:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:54:53,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:54:53,318 INFO L87 Difference]: Start difference. First operand has 100 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:54:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:53,399 INFO L93 Difference]: Finished difference Result 288 states and 525 transitions. [2025-03-03 23:54:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:54:53,401 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2025-03-03 23:54:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:53,408 INFO L225 Difference]: With dead ends: 288 [2025-03-03 23:54:53,410 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 23:54:53,414 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 23:54:53,417 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:53,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:54:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 23:54:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2025-03-03 23:54:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 23:54:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 296 transitions. [2025-03-03 23:54:53,486 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 296 transitions. Word has length 206 [2025-03-03 23:54:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:53,488 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 296 transitions. [2025-03-03 23:54:53,488 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:54:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 296 transitions. [2025-03-03 23:54:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:54:53,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:53,493 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:54:53,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 23:54:53,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:53,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:53,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1022464000, now seen corresponding path program 1 times [2025-03-03 23:54:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:53,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180360143] [2025-03-03 23:54:53,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:53,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:54:53,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:54:53,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:53,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:54:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180360143] [2025-03-03 23:54:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180360143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:54:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222481504] [2025-03-03 23:54:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:54:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:54:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:54:58,579 INFO L87 Difference]: Start difference. First operand 188 states and 296 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:54:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:54:59,811 INFO L93 Difference]: Finished difference Result 638 states and 988 transitions. [2025-03-03 23:54:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 23:54:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2025-03-03 23:54:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:54:59,816 INFO L225 Difference]: With dead ends: 638 [2025-03-03 23:54:59,816 INFO L226 Difference]: Without dead ends: 453 [2025-03-03 23:54:59,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:54:59,817 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 282 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:54:59,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1241 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 23:54:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-03 23:54:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 269. [2025-03-03 23:54:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 188 states have (on average 1.4148936170212767) internal successors, (266), 189 states have internal predecessors, (266), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 23:54:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 418 transitions. [2025-03-03 23:54:59,863 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 418 transitions. Word has length 206 [2025-03-03 23:54:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:54:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 418 transitions. [2025-03-03 23:54:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:54:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 418 transitions. [2025-03-03 23:54:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:54:59,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:54:59,867 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:54:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:54:59,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:54:59,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:54:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1015592289, now seen corresponding path program 1 times [2025-03-03 23:54:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:54:59,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608326657] [2025-03-03 23:54:59,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:54:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:54:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:54:59,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:54:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:54:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:54:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:54:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:54:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608326657] [2025-03-03 23:54:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608326657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:54:59,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:54:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:54:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545808330] [2025-03-03 23:54:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:54:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:54:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:54:59,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:54:59,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:54:59,946 INFO L87 Difference]: Start difference. First operand 269 states and 418 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:00,020 INFO L93 Difference]: Finished difference Result 688 states and 1061 transitions. [2025-03-03 23:55:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:55:00,021 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2025-03-03 23:55:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:00,028 INFO L225 Difference]: With dead ends: 688 [2025-03-03 23:55:00,028 INFO L226 Difference]: Without dead ends: 441 [2025-03-03 23:55:00,029 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 23:55:00,031 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 134 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:00,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 408 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:55:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-03 23:55:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 366. [2025-03-03 23:55:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 251 states have (on average 1.3784860557768925) internal successors, (346), 253 states have internal predecessors, (346), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:55:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 562 transitions. [2025-03-03 23:55:00,080 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 562 transitions. Word has length 206 [2025-03-03 23:55:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:00,080 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 562 transitions. [2025-03-03 23:55:00,080 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 562 transitions. [2025-03-03 23:55:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:55:00,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:00,084 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:00,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:55:00,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:00,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1042581601, now seen corresponding path program 1 times [2025-03-03 23:55:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937778254] [2025-03-03 23:55:00,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:00,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:55:00,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:55:00,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:55:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937778254] [2025-03-03 23:55:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937778254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:55:00,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:55:00,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:55:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676975673] [2025-03-03 23:55:00,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:55:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:55:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:00,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:55:00,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:55:00,343 INFO L87 Difference]: Start difference. First operand 366 states and 562 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:00,426 INFO L93 Difference]: Finished difference Result 754 states and 1156 transitions. [2025-03-03 23:55:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:55:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2025-03-03 23:55:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:00,430 INFO L225 Difference]: With dead ends: 754 [2025-03-03 23:55:00,430 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 23:55:00,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:55:00,433 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 115 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:00,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 385 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:55:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 23:55:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 366. [2025-03-03 23:55:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 251 states have (on average 1.3705179282868525) internal successors, (344), 253 states have internal predecessors, (344), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:55:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 560 transitions. [2025-03-03 23:55:00,470 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 560 transitions. Word has length 206 [2025-03-03 23:55:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:00,470 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 560 transitions. [2025-03-03 23:55:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 560 transitions. [2025-03-03 23:55:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 23:55:00,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:00,472 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:00,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:55:00,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:00,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash 304485336, now seen corresponding path program 1 times [2025-03-03 23:55:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:00,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995199358] [2025-03-03 23:55:00,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:00,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:00,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 23:55:00,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 23:55:00,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:00,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:55:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995199358] [2025-03-03 23:55:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995199358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:55:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:55:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:55:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590298388] [2025-03-03 23:55:00,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:55:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:55:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:00,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:55:00,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:55:00,725 INFO L87 Difference]: Start difference. First operand 366 states and 560 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:00,792 INFO L93 Difference]: Finished difference Result 582 states and 889 transitions. [2025-03-03 23:55:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:55:00,793 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2025-03-03 23:55:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:00,795 INFO L225 Difference]: With dead ends: 582 [2025-03-03 23:55:00,795 INFO L226 Difference]: Without dead ends: 443 [2025-03-03 23:55:00,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 23:55:00,796 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 97 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:00,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 451 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:55:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-03 23:55:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 368. [2025-03-03 23:55:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 253 states have (on average 1.3675889328063242) internal successors, (346), 255 states have internal predecessors, (346), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:55:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2025-03-03 23:55:00,831 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 207 [2025-03-03 23:55:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2025-03-03 23:55:00,832 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2025-03-03 23:55:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 23:55:00,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:00,834 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:55:00,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:00,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1626617391, now seen corresponding path program 1 times [2025-03-03 23:55:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410324541] [2025-03-03 23:55:00,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:00,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 23:55:00,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 23:55:00,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:55:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410324541] [2025-03-03 23:55:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410324541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:55:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:55:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:55:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920023874] [2025-03-03 23:55:05,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:55:05,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:55:05,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:05,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:55:05,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:55:05,098 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:06,039 INFO L93 Difference]: Finished difference Result 841 states and 1269 transitions. [2025-03-03 23:55:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:55:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2025-03-03 23:55:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:06,042 INFO L225 Difference]: With dead ends: 841 [2025-03-03 23:55:06,042 INFO L226 Difference]: Without dead ends: 495 [2025-03-03 23:55:06,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:55:06,045 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 390 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:06,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 815 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:55:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-03 23:55:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 370. [2025-03-03 23:55:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 257 states have internal predecessors, (350), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:55:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 566 transitions. [2025-03-03 23:55:06,080 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 566 transitions. Word has length 207 [2025-03-03 23:55:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:06,081 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 566 transitions. [2025-03-03 23:55:06,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 566 transitions. [2025-03-03 23:55:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 23:55:06,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:06,083 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:55:06,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:06,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1738832455, now seen corresponding path program 1 times [2025-03-03 23:55:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290496845] [2025-03-03 23:55:06,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:06,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 23:55:06,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 23:55:06,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:06,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:55:06,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:06,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290496845] [2025-03-03 23:55:06,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290496845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:55:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:55:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:55:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694015272] [2025-03-03 23:55:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:55:06,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:55:06,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:06,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:55:06,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:55:06,402 INFO L87 Difference]: Start difference. First operand 370 states and 566 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:06,464 INFO L93 Difference]: Finished difference Result 830 states and 1263 transitions. [2025-03-03 23:55:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:55:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2025-03-03 23:55:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:06,468 INFO L225 Difference]: With dead ends: 830 [2025-03-03 23:55:06,468 INFO L226 Difference]: Without dead ends: 482 [2025-03-03 23:55:06,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:55:06,470 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 212 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:06,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 404 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:55:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-03 23:55:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 372. [2025-03-03 23:55:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 257 states have (on average 1.3696498054474708) internal successors, (352), 259 states have internal predecessors, (352), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:55:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 568 transitions. [2025-03-03 23:55:06,501 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 568 transitions. Word has length 207 [2025-03-03 23:55:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:06,501 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 568 transitions. [2025-03-03 23:55:06,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 568 transitions. [2025-03-03 23:55:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 23:55:06,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:06,507 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:06,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:55:06,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:06,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 518078552, now seen corresponding path program 1 times [2025-03-03 23:55:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397366626] [2025-03-03 23:55:06,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:06,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 23:55:06,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 23:55:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397366626] [2025-03-03 23:55:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397366626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:55:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710773201] [2025-03-03 23:55:06,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:06,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:06,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:55:06,716 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 23:55:06,718 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 23:55:06,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 23:55:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 23:55:06,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:06,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:06,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:55:06,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 153 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2025-03-03 23:55:07,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:55:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:07,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710773201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:55:07,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:55:07,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:55:07,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398882710] [2025-03-03 23:55:07,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:55:07,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:55:07,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:07,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:55:07,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:55:07,376 INFO L87 Difference]: Start difference. First operand 372 states and 568 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-03 23:55:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:07,553 INFO L93 Difference]: Finished difference Result 610 states and 915 transitions. [2025-03-03 23:55:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:55:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 207 [2025-03-03 23:55:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:07,558 INFO L225 Difference]: With dead ends: 610 [2025-03-03 23:55:07,559 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 23:55:07,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:55:07,561 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:07,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 256 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:55:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 23:55:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2025-03-03 23:55:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 160 states have (on average 1.29375) internal successors, (207), 161 states have internal predecessors, (207), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 23:55:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 359 transitions. [2025-03-03 23:55:07,585 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 359 transitions. Word has length 207 [2025-03-03 23:55:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:07,586 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 359 transitions. [2025-03-03 23:55:07,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-03 23:55:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 359 transitions. [2025-03-03 23:55:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:55:07,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:07,588 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:07,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:55:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:07,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:07,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1786006018, now seen corresponding path program 1 times [2025-03-03 23:55:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:07,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169680897] [2025-03-03 23:55:07,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:07,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169680897] [2025-03-03 23:55:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169680897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:55:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854322932] [2025-03-03 23:55:07,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:07,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:55:07,990 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 23:55:07,991 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 23:55:08,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:08,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:08,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:08,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:08,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:55:08,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2025-03-03 23:55:08,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:55:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854322932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:55:08,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:55:08,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:55:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797341451] [2025-03-03 23:55:08,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:55:08,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:55:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:08,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:55:08,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:55:08,415 INFO L87 Difference]: Start difference. First operand 244 states and 359 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 23:55:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:08,594 INFO L93 Difference]: Finished difference Result 484 states and 701 transitions. [2025-03-03 23:55:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:55:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 208 [2025-03-03 23:55:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:08,597 INFO L225 Difference]: With dead ends: 484 [2025-03-03 23:55:08,597 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 23:55:08,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:55:08,598 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 206 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:08,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 253 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:55:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 23:55:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2025-03-03 23:55:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 166 states have (on average 1.2710843373493976) internal successors, (211), 167 states have internal predecessors, (211), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 23:55:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 363 transitions. [2025-03-03 23:55:08,616 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 363 transitions. Word has length 208 [2025-03-03 23:55:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:08,617 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 363 transitions. [2025-03-03 23:55:08,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 23:55:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 363 transitions. [2025-03-03 23:55:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:55:08,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:08,619 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:08,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:55:08,823 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,SelfDestructingSolverStorable8 [2025-03-03 23:55:08,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:08,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash -541241537, now seen corresponding path program 1 times [2025-03-03 23:55:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:08,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531245143] [2025-03-03 23:55:08,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:08,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:08,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:08,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:08,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:55:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21010134] [2025-03-03 23:55:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:55:08,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:55:08,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:55:08,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:09,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:09,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:09,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:09,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 23:55:09,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1403 proven. 51 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-03-03 23:55:10,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:55:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 129 proven. 54 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2025-03-03 23:55:12,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:55:12,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531245143] [2025-03-03 23:55:12,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 23:55:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21010134] [2025-03-03 23:55:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21010134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:55:12,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:55:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2025-03-03 23:55:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399972756] [2025-03-03 23:55:12,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:55:12,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 23:55:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:55:12,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 23:55:12,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-03 23:55:12,975 INFO L87 Difference]: Start difference. First operand 252 states and 363 transitions. Second operand has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2025-03-03 23:55:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:16,531 INFO L93 Difference]: Finished difference Result 778 states and 1076 transitions. [2025-03-03 23:55:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 23:55:16,532 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) Word has length 208 [2025-03-03 23:55:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:16,535 INFO L225 Difference]: With dead ends: 778 [2025-03-03 23:55:16,535 INFO L226 Difference]: Without dead ends: 552 [2025-03-03 23:55:16,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=691, Invalid=1565, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 23:55:16,537 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 799 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:16,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1098 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 23:55:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-03 23:55:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 377. [2025-03-03 23:55:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 250 states have (on average 1.224) internal successors, (306), 252 states have internal predecessors, (306), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 23:55:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 518 transitions. [2025-03-03 23:55:16,596 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 518 transitions. Word has length 208 [2025-03-03 23:55:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:16,596 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 518 transitions. [2025-03-03 23:55:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2025-03-03 23:55:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 518 transitions. [2025-03-03 23:55:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:55:16,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:16,599 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:16,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:55:16,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:16,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:16,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash 288905760, now seen corresponding path program 1 times [2025-03-03 23:55:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:55:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376613309] [2025-03-03 23:55:16,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:55:16,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:16,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:16,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:16,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:55:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389067256] [2025-03-03 23:55:16,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:55:16,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:55:16,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:55:16,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:17,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:17,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:17,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:55:17,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:55:17,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:55:17,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:55:17,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:17,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:55:17,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:55:17,145 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:55:17,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:55:17,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:55:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:55:17,350 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:55:17,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:55:17,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:55:17 BoogieIcfgContainer [2025-03-03 23:55:17,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:55:17,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:55:17,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:55:17,449 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:55:17,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:54:52" (3/4) ... [2025-03-03 23:55:17,451 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:55:17,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:55:17,453 INFO L158 Benchmark]: Toolchain (without parser) took 25766.25ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 107.6MB in the beginning and 467.0MB in the end (delta: -359.4MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2025-03-03 23:55:17,453 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:55:17,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.31ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 90.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:55:17,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.60ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 85.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:55:17,453 INFO L158 Benchmark]: Boogie Preprocessor took 42.54ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 78.9MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:55:17,453 INFO L158 Benchmark]: IcfgBuilder took 446.33ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 47.5MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 23:55:17,454 INFO L158 Benchmark]: TraceAbstraction took 24992.69ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 46.4MB in the beginning and 467.2MB in the end (delta: -420.7MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2025-03-03 23:55:17,454 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 629.1MB. Free memory was 467.2MB in the beginning and 467.0MB in the end (delta: 203.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:55:17,455 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.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.31ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 90.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.60ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 85.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.54ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 78.9MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 446.33ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 47.5MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24992.69ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 46.4MB in the beginning and 467.2MB in the end (delta: -420.7MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 629.1MB. Free memory was 467.2MB in the beginning and 467.0MB in the end (delta: 203.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 75, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_9 = 0; [L25] unsigned char var_1_10 = 1; [L26] signed char var_1_11 = -8; [L27] signed char var_1_12 = -50; [L28] signed char var_1_13 = 25; [L29] signed char var_1_14 = 100; [L30] signed char var_1_15 = 32; [L31] signed char var_1_16 = 25; [L32] signed long int var_1_17 = 50; [L33] signed long int var_1_18 = -32; [L34] signed short int var_1_19 = 256; [L35] unsigned long int var_1_20 = 64; [L36] unsigned char var_1_21 = 1; [L37] unsigned char var_1_22 = 0; [L38] float var_1_23 = 1.4; [L39] float var_1_24 = 3.875; [L40] float var_1_25 = 255.375; [L41] float var_1_26 = 0.65; [L42] float var_1_27 = 64.75; [L43] float var_1_28 = 3.5; [L44] signed long int var_1_29 = 16; [L45] unsigned char var_1_31 = 5; [L46] unsigned char var_1_32 = 128; [L47] unsigned char var_1_33 = 64; [L48] unsigned char var_1_34 = 2; [L49] signed short int var_1_35 = -128; [L50] signed short int var_1_36 = 19851; [L51] signed short int var_1_37 = 28837; [L52] float var_1_38 = 31.2; [L53] float var_1_39 = 127.6; [L54] unsigned long int last_1_var_1_20 = 64; VAL [isInitial=0, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L136] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L137] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L138] var_1_10 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L141] var_1_12 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L147] var_1_14 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L150] var_1_15 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L153] var_1_16 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L156] var_1_22 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_22 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_22 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L159] var_1_24 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L160] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L161] var_1_25 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L162] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L163] var_1_26 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L164] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L165] var_1_27 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L166] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L167] var_1_28 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L168] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_32 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_32 >= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L173] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L178] var_1_36 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_36 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L179] RET assume_abort_if_not(var_1_36 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L181] var_1_37 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_37 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L182] RET assume_abort_if_not(var_1_37 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_37 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] RET assume_abort_if_not(var_1_37 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L184] var_1_39 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L185] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L199] RET updateVariables() [L200] CALL step() [L58] var_1_17 = ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16)))) [L59] var_1_21 = (! (var_1_9 && var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L60] COND TRUE \read(var_1_21) [L61] var_1_23 = ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L63] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L66] COND FALSE !(\read(var_1_9)) [L73] var_1_38 = var_1_25 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L75] COND TRUE (- var_1_23) == var_1_23 [L76] var_1_1 = (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L80] unsigned char stepLocal_0 = var_1_17 < var_1_31; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L81] COND FALSE !((127.35 + var_1_23) <= var_1_23) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L88] COND TRUE \read(var_1_21) [L89] var_1_11 = ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L93] COND FALSE !(\read(var_1_7)) [L96] var_1_18 = (var_1_15 + var_1_14) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] COND TRUE last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18) [L99] var_1_20 = ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L103] COND FALSE !(\read(var_1_7)) [L106] var_1_29 = ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L108] unsigned char stepLocal_5 = (var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33))); [L109] signed long int stepLocal_4 = var_1_29; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L110] COND FALSE !(stepLocal_5 && var_1_21) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L115] COND TRUE var_1_31 == stepLocal_4 [L116] var_1_35 = ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L121] signed long int stepLocal_3 = var_1_17; [L122] unsigned char stepLocal_2 = var_1_10; [L123] signed short int stepLocal_1 = var_1_35; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_1=127, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L124] COND FALSE !((var_1_15 + var_1_17) == stepLocal_1) [L131] var_1_19 = ((((var_1_13) < (128)) ? (var_1_13) : (128))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191-L192] return ((((((((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31)))) && (var_1_21 == ((unsigned char) (! (var_1_9 && var_1_22))))) && (var_1_21 ? (var_1_23 == ((float) ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))))) : 1)) && (var_1_7 ? (var_1_29 == ((signed long int) ((1349734853 - var_1_16) - (1715174523 - var_1_31)))) : (var_1_29 == ((signed long int) ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))))))) && (var_1_22 ? (var_1_31 == ((unsigned char) ((((var_1_16) < ((var_1_32 - (var_1_33 - var_1_34)))) ? (var_1_16) : ((var_1_32 - (var_1_33 - var_1_34))))))) : 1)) && ((((var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33)))) && var_1_21) ? ((var_1_23 <= 0.125f) ? (var_1_35 == ((signed short int) ((((((var_1_36) < (var_1_37)) ? (var_1_36) : (var_1_37))) - var_1_33) - var_1_16))) : 1) : ((var_1_31 == var_1_29) ? (var_1_35 == ((signed short int) ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))) : (var_1_35 == ((signed short int) var_1_13))))) && (var_1_9 ? ((var_1_25 == var_1_26) ? (var_1_38 == ((float) (((((var_1_24) < (var_1_39)) ? (var_1_24) : (var_1_39))) + var_1_25))) : (var_1_38 == ((float) var_1_39))) : (var_1_38 == ((float) var_1_25))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=64, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 11, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2412 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2379 mSDsluCounter, 5596 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3999 mSDsCounter, 574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3298 IncrementalHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 574 mSolverCounterUnsat, 1597 mSDtfsCounter, 3298 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1345 GetRequests, 1245 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=10, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 817 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 3107 NumberOfCodeBlocks, 3107 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3091 ConstructedInterpolants, 0 QuantifiedInterpolants, 19400 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1437 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 29241/29760 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 23:55:17,557 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_operatoramount_amount100_file-41.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 3f6a57117b69ef8d0664b771b2ca3514fdde54ed8e1d3413e00014e5fcf2fa34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:55:19,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:55:19,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:55:19,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:55:19,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:55:19,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:55:19,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:55:19,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:55:19,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:55:19,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:55:19,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:55:19,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:55:19,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:55:19,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:55:19,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:55:19,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:55:19,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:55:19,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:55:19,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 -> 3f6a57117b69ef8d0664b771b2ca3514fdde54ed8e1d3413e00014e5fcf2fa34 [2025-03-03 23:55:19,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:55:19,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:55:19,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:55:19,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:55:19,637 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:55:19,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-41.i [2025-03-03 23:55:20,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7534fe72a/b98bd15046d04304a06fe42d88d4cce3/FLAG581a90884 [2025-03-03 23:55:20,990 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:55:20,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-41.i [2025-03-03 23:55:21,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7534fe72a/b98bd15046d04304a06fe42d88d4cce3/FLAG581a90884 [2025-03-03 23:55:21,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7534fe72a/b98bd15046d04304a06fe42d88d4cce3 [2025-03-03 23:55:21,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:55:21,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:55:21,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:55:21,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:55:21,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:55:21,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21, skipping insertion in model container [2025-03-03 23:55:21,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:55:21,444 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_operatoramount_amount100_file-41.i[916,929] [2025-03-03 23:55:21,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:55:21,502 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:55:21,511 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_operatoramount_amount100_file-41.i[916,929] [2025-03-03 23:55:21,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:55:21,554 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:55:21,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21 WrapperNode [2025-03-03 23:55:21,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:55:21,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:55:21,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:55:21,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:55:21,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,608 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-03 23:55:21,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:55:21,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:55:21,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:55:21,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:55:21,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,643 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 23:55:21,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:55:21,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:55:21,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:55:21,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:55:21,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (1/1) ... [2025-03-03 23:55:21,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:55:21,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:55:21,699 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 23:55:21,701 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 23:55:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:55:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:55:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:55:21,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:55:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:55:21,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:55:21,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:55:21,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:55:27,915 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 23:55:27,915 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:55:27,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:55:27,923 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:55:27,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:27 BoogieIcfgContainer [2025-03-03 23:55:27,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:55:27,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:55:27,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:55:27,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:55:27,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:55:21" (1/3) ... [2025-03-03 23:55:27,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6f564e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:27, skipping insertion in model container [2025-03-03 23:55:27,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:21" (2/3) ... [2025-03-03 23:55:27,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6f564e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:27, skipping insertion in model container [2025-03-03 23:55:27,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:27" (3/3) ... [2025-03-03 23:55:27,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-41.i [2025-03-03 23:55:27,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:55:27,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-41.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:55:27,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:55:27,988 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;@6bf21739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:55:27,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:55:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:55:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:55:28,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:28,000 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:28,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 445057801, now seen corresponding path program 1 times [2025-03-03 23:55:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:55:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310163280] [2025-03-03 23:55:28,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:28,013 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 23:55:28,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:55:28,015 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 23:55:28,016 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 23:55:28,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:55:28,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:55:28,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:28,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:28,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:55:28,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 23:55:28,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:55:28,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:55:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310163280] [2025-03-03 23:55:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310163280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:55:28,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:55:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:55:28,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253034621] [2025-03-03 23:55:28,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:55:28,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:55:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:55:28,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:55:28,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:55:28,523 INFO L87 Difference]: Start difference. First operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 23:55:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:28,545 INFO L93 Difference]: Finished difference Result 172 states and 305 transitions. [2025-03-03 23:55:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:55:28,547 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-03 23:55:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:28,551 INFO L225 Difference]: With dead ends: 172 [2025-03-03 23:55:28,551 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 23:55:28,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 23:55:28,555 INFO L435 NwaCegarLoop]: 134 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, 134 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 23:55:28,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:55:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 23:55:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 23:55:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:55:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-03-03 23:55:28,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2025-03-03 23:55:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:28,595 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-03-03 23:55:28,595 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 23:55:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-03-03 23:55:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:55:28,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:28,600 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:28,613 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 23:55:28,800 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 23:55:28,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1567474619, now seen corresponding path program 1 times [2025-03-03 23:55:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:55:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320321491] [2025-03-03 23:55:28,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:28,803 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 23:55:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:55:28,806 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 23:55:28,807 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 23:55:28,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:55:29,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:55:29,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:29,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:29,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:55:29,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 153 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2025-03-03 23:55:29,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:55:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:30,347 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:55:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320321491] [2025-03-03 23:55:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320321491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:55:30,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:55:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 23:55:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107340135] [2025-03-03 23:55:30,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:55:30,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:55:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:55:30,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:55:30,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:55:30,351 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-03 23:55:33,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:55:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:33,361 INFO L93 Difference]: Finished difference Result 176 states and 270 transitions. [2025-03-03 23:55:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:55:33,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 203 [2025-03-03 23:55:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:33,363 INFO L225 Difference]: With dead ends: 176 [2025-03-03 23:55:33,363 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 23:55:33,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:55:33,365 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 150 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:33,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 189 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 23:55:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 23:55:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2025-03-03 23:55:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:55:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-03 23:55:33,377 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 203 [2025-03-03 23:55:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:33,378 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-03 23:55:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-03 23:55:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-03 23:55:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:55:33,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:33,380 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:33,393 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 23:55:33,580 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 23:55:33,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -723002748, now seen corresponding path program 1 times [2025-03-03 23:55:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:55:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826071421] [2025-03-03 23:55:33,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:33,582 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 23:55:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:55:33,583 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 23:55:33,584 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 23:55:33,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:55:33,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:55:33,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:33,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:33,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:55:33,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2025-03-03 23:55:34,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:55:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:34,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:55:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826071421] [2025-03-03 23:55:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826071421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:55:34,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:55:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 23:55:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245421241] [2025-03-03 23:55:34,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:55:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:55:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:55:34,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:55:34,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:55:34,597 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 23:55:37,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:55:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:37,186 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2025-03-03 23:55:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:55:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 203 [2025-03-03 23:55:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:37,209 INFO L225 Difference]: With dead ends: 185 [2025-03-03 23:55:37,210 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 23:55:37,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:55:37,211 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 107 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 205 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 23:55:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 23:55:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-03-03 23:55:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:55:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-03 23:55:37,225 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 203 [2025-03-03 23:55:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-03 23:55:37,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 23:55:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-03 23:55:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:55:37,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:37,229 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:37,244 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 23:55:37,429 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 23:55:37,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:37,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1720075101, now seen corresponding path program 1 times [2025-03-03 23:55:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:55:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816163895] [2025-03-03 23:55:37,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:37,431 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 23:55:37,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:55:37,433 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 23:55:37,433 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 23:55:37,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:55:37,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:55:37,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:37,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:37,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:55:37,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 23:55:38,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:55:38,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:55:38,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816163895] [2025-03-03 23:55:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816163895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:55:38,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:55:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:55:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251554185] [2025-03-03 23:55:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:55:38,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:55:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:55:38,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:55:38,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:55:38,413 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:41,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:55:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:41,370 INFO L93 Difference]: Finished difference Result 273 states and 393 transitions. [2025-03-03 23:55:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:55:41,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-03 23:55:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:41,394 INFO L225 Difference]: With dead ends: 273 [2025-03-03 23:55:41,394 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 23:55:41,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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 23:55:41,395 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:41,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 242 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 23:55:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 23:55:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2025-03-03 23:55:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 109 states have (on average 1.201834862385321) internal successors, (131), 109 states have internal predecessors, (131), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 23:55:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2025-03-03 23:55:41,414 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 203 [2025-03-03 23:55:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:41,414 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2025-03-03 23:55:41,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 23:55:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2025-03-03 23:55:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:55:41,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:41,416 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:41,430 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 23:55:41,616 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 23:55:41,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1787505887, now seen corresponding path program 1 times [2025-03-03 23:55:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:55:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073978218] [2025-03-03 23:55:41,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:41,618 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 23:55:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:55:41,619 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 23:55:41,620 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 23:55:41,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:55:41,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:55:41,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:41,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:41,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:55:41,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:55:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 972 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:55:43,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:55:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 69 proven. 24 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 23:55:45,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:55:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073978218] [2025-03-03 23:55:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073978218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:55:45,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:55:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2025-03-03 23:55:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564007084] [2025-03-03 23:55:45,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:55:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 23:55:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:55:45,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 23:55:45,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:55:45,952 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 6 states have call successors, (64), 5 states have call predecessors, (64), 8 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-03 23:55:52,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:55:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:55:53,977 INFO L93 Difference]: Finished difference Result 466 states and 631 transitions. [2025-03-03 23:55:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 23:55:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 6 states have call successors, (64), 5 states have call predecessors, (64), 8 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 203 [2025-03-03 23:55:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:55:53,982 INFO L225 Difference]: With dead ends: 466 [2025-03-03 23:55:53,982 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 23:55:53,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=369, Invalid=821, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 23:55:53,983 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 190 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:55:53,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 556 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-03 23:55:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 23:55:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 272. [2025-03-03 23:55:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 164 states have (on average 1.1097560975609757) internal successors, (182), 165 states have internal predecessors, (182), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 23:55:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 356 transitions. [2025-03-03 23:55:54,020 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 356 transitions. Word has length 203 [2025-03-03 23:55:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:55:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 356 transitions. [2025-03-03 23:55:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 6 states have call successors, (64), 5 states have call predecessors, (64), 8 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-03 23:55:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 356 transitions. [2025-03-03 23:55:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 23:55:54,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:55:54,025 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:55:54,040 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 23:55:54,225 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 23:55:54,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:55:54,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:55:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1730311810, now seen corresponding path program 1 times [2025-03-03 23:55:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:55:54,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352797854] [2025-03-03 23:55:54,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:55:54,227 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 23:55:54,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:55:54,230 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 23:55:54,231 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 23:55:54,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 23:55:54,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 23:55:54,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:55:54,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:55:54,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 23:55:54,583 INFO L279 TraceCheckSpWp]: Computing forward predicates...