./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_loopvsstraightlinecode_100-1loop_file-42.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 aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:03:18,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:03:18,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:03:18,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:03:18,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:03:18,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:03:18,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:03:18,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:03:18,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:03:18,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:03:18,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:03:18,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:03:18,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:03:18,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:03:18,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:03:18,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:03:18,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:03:18,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:03:18,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:03:18,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:03:18,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:03:18,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:03:18,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:03:18,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:03:18,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:03:18,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:03:18,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:03:18,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:03:18,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:03:18,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:03:18,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:03:18,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:03:18,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:18,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:03:18,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:03:18,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:03:18,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:03:18,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:03:18,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:03:18,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:03:18,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:03:18,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:03:18,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 [2024-11-10 07:03:19,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:03:19,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:03:19,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:03:19,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:03:19,080 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:03:19,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2024-11-10 07:03:20,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:03:20,787 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:03:20,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2024-11-10 07:03:20,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeaf1bbb/977a86f0928d44feabeb2a30af598565/FLAGe9a3a205f [2024-11-10 07:03:21,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeaf1bbb/977a86f0928d44feabeb2a30af598565 [2024-11-10 07:03:21,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:03:21,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:03:21,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:21,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:03:21,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:03:21,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53086db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21, skipping insertion in model container [2024-11-10 07:03:21,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:03:21,393 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_loopvsstraightlinecode_100-1loop_file-42.i[916,929] [2024-11-10 07:03:21,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:21,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:03:21,534 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_loopvsstraightlinecode_100-1loop_file-42.i[916,929] [2024-11-10 07:03:21,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:21,616 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:03:21,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21 WrapperNode [2024-11-10 07:03:21,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:21,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:21,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:03:21,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:03:21,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,683 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-10 07:03:21,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:21,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:03:21,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:03:21,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:03:21,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,735 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]. [2024-11-10 07:03:21,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:03:21,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:03:21,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:03:21,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:03:21,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (1/1) ... [2024-11-10 07:03:21,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:21,827 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) [2024-11-10 07:03:21,833 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 [2024-11-10 07:03:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:03:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:03:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:03:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:03:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:03:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:03:21,979 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:03:21,982 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:03:22,435 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 07:03:22,472 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:03:22,472 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:03:22,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:03:22,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:03:22,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:22 BoogieIcfgContainer [2024-11-10 07:03:22,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:03:22,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:03:22,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:03:22,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:03:22,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:03:21" (1/3) ... [2024-11-10 07:03:22,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b37a2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:22, skipping insertion in model container [2024-11-10 07:03:22,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:21" (2/3) ... [2024-11-10 07:03:22,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b37a2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:22, skipping insertion in model container [2024-11-10 07:03:22,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:22" (3/3) ... [2024-11-10 07:03:22,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-42.i [2024-11-10 07:03:22,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:03:22,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:03:22,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:03:22,637 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;@26dca24e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:03:22,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:03:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:03:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 07:03:22,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:22,665 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:22,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:22,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1861382281, now seen corresponding path program 1 times [2024-11-10 07:03:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61558910] [2024-11-10 07:03:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:03:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 07:03:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 07:03:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:03:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:03:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:03:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:03:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:03:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:03:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:03:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:03:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:03:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:03:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:03:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:03:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:03:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:03:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61558910] [2024-11-10 07:03:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61558910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:23,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:23,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:03:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595695658] [2024-11-10 07:03:23,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:03:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:03:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:23,227 INFO L87 Difference]: Start difference. First operand has 84 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:03:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:23,276 INFO L93 Difference]: Finished difference Result 164 states and 268 transitions. [2024-11-10 07:03:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:03:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2024-11-10 07:03:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:23,288 INFO L225 Difference]: With dead ends: 164 [2024-11-10 07:03:23,289 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 07:03:23,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:23,298 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:23,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:03:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 07:03:23,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 07:03:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:03:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2024-11-10 07:03:23,355 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 143 [2024-11-10 07:03:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:23,356 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2024-11-10 07:03:23,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:03:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2024-11-10 07:03:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 07:03:23,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:23,363 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:23,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:03:23,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:23,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1474532553, now seen corresponding path program 1 times [2024-11-10 07:03:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570258395] [2024-11-10 07:03:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:03:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 07:03:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 07:03:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:03:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:03:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:03:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:03:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:03:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:03:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:03:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:03:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:03:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:03:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:03:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:03:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:03:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:03:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:24,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570258395] [2024-11-10 07:03:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570258395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:24,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:24,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:03:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726380213] [2024-11-10 07:03:24,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:03:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:03:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:03:24,392 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:03:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:24,709 INFO L93 Difference]: Finished difference Result 233 states and 350 transitions. [2024-11-10 07:03:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:03:24,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-10 07:03:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:24,712 INFO L225 Difference]: With dead ends: 233 [2024-11-10 07:03:24,712 INFO L226 Difference]: Without dead ends: 157 [2024-11-10 07:03:24,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:03:24,717 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 96 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:24,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 424 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:03:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-10 07:03:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2024-11-10 07:03:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 07:03:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-11-10 07:03:24,753 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 143 [2024-11-10 07:03:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:24,753 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-11-10 07:03:24,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:03:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-11-10 07:03:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:03:24,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:24,756 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:03:24,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -675298234, now seen corresponding path program 1 times [2024-11-10 07:03:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226819783] [2024-11-10 07:03:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 07:03:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 07:03:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 07:03:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:03:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:03:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:03:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:03:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:03:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:03:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:03:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:03:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:03:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:03:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:03:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:03:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:03:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 81 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-10 07:03:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226819783] [2024-11-10 07:03:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226819783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943882523] [2024-11-10 07:03:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:25,611 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) [2024-11-10 07:03:25,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:03:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:25,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 07:03:25,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 338 proven. 81 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2024-11-10 07:03:26,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-10 07:03:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943882523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:27,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:03:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 17 [2024-11-10 07:03:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123460443] [2024-11-10 07:03:27,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:27,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 07:03:27,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:27,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 07:03:27,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-10 07:03:27,139 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-10 07:03:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:27,573 INFO L93 Difference]: Finished difference Result 235 states and 327 transitions. [2024-11-10 07:03:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 07:03:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 144 [2024-11-10 07:03:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:27,579 INFO L225 Difference]: With dead ends: 235 [2024-11-10 07:03:27,579 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 07:03:27,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 316 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2024-11-10 07:03:27,581 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 145 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:27,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 300 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:03:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 07:03:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2024-11-10 07:03:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 98 states have internal predecessors, (118), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 07:03:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2024-11-10 07:03:27,619 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 144 [2024-11-10 07:03:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:27,619 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2024-11-10 07:03:27,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-10 07:03:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2024-11-10 07:03:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:03:27,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:27,624 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:27,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:03:27,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:27,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:27,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:27,830 INFO L85 PathProgramCache]: Analyzing trace with hash -546215515, now seen corresponding path program 1 times [2024-11-10 07:03:27,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:27,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377441281] [2024-11-10 07:03:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:27,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:03:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650683144] [2024-11-10 07:03:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:27,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:27,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:27,966 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) [2024-11-10 07:03:27,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:03:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:28,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 07:03:28,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 469 proven. 48 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-10 07:03:28,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:29,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377441281] [2024-11-10 07:03:29,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:03:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650683144] [2024-11-10 07:03:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650683144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:29,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:03:29,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-10 07:03:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852365439] [2024-11-10 07:03:29,121 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:29,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:03:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:29,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:03:29,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-10 07:03:29,123 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-10 07:03:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:29,639 INFO L93 Difference]: Finished difference Result 282 states and 378 transitions. [2024-11-10 07:03:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 07:03:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 144 [2024-11-10 07:03:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:29,642 INFO L225 Difference]: With dead ends: 282 [2024-11-10 07:03:29,642 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 07:03:29,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2024-11-10 07:03:29,648 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 134 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:29,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 529 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:03:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 07:03:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2024-11-10 07:03:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 07:03:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 217 transitions. [2024-11-10 07:03:29,684 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 217 transitions. Word has length 144 [2024-11-10 07:03:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:29,685 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 217 transitions. [2024-11-10 07:03:29,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-10 07:03:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 217 transitions. [2024-11-10 07:03:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:03:29,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:29,691 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:29,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:03:29,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 07:03:29,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 961336294, now seen corresponding path program 1 times [2024-11-10 07:03:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557952110] [2024-11-10 07:03:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:03:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846500376] [2024-11-10 07:03:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:29,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:29,993 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) [2024-11-10 07:03:29,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:03:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:03:30,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:03:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:03:30,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:03:30,335 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:03:30,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:03:30,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:03:30,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:30,541 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 07:03:30,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:03:30,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:03:30 BoogieIcfgContainer [2024-11-10 07:03:30,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:03:30,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:03:30,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:03:30,657 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:03:30,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:22" (3/4) ... [2024-11-10 07:03:30,660 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:03:30,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:03:30,661 INFO L158 Benchmark]: Toolchain (without parser) took 9500.26ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 126.2MB in the beginning and 124.0MB in the end (delta: 2.3MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2024-11-10 07:03:30,662 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:03:30,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.21ms. Allocated memory is still 184.5MB. Free memory was 126.2MB in the beginning and 107.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:03:30,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.77ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 101.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:03:30,662 INFO L158 Benchmark]: Boogie Preprocessor took 96.47ms. Allocated memory is still 184.5MB. Free memory was 101.4MB in the beginning and 94.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:03:30,663 INFO L158 Benchmark]: IcfgBuilder took 738.31ms. Allocated memory is still 184.5MB. Free memory was 94.0MB in the beginning and 149.0MB in the end (delta: -55.0MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-11-10 07:03:30,663 INFO L158 Benchmark]: TraceAbstraction took 8134.01ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 148.4MB in the beginning and 124.0MB in the end (delta: 24.4MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. [2024-11-10 07:03:30,663 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 323.0MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:03:30,664 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.21ms. Allocated memory is still 184.5MB. Free memory was 126.2MB in the beginning and 107.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.77ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 101.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.47ms. Allocated memory is still 184.5MB. Free memory was 101.4MB in the beginning and 94.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 738.31ms. Allocated memory is still 184.5MB. Free memory was 94.0MB in the beginning and 149.0MB in the end (delta: -55.0MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8134.01ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 148.4MB in the beginning and 124.0MB in the end (delta: 24.4MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 323.0MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 50.75; [L23] double var_1_3 = 8.5; [L24] double var_1_4 = 64.5; [L25] double var_1_5 = 9.3; [L26] unsigned char var_1_6 = 1; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 2; [L31] double var_1_12 = 127.6; [L32] unsigned char var_1_13 = 0; [L33] signed long int var_1_14 = 1; [L34] unsigned char var_1_15 = 128; [L35] unsigned char var_1_16 = 128; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 16; [L38] unsigned char var_1_19 = 0; [L39] signed char var_1_21 = -32; [L40] signed char var_1_22 = 2; [L41] double var_1_23 = 15.5; [L42] float var_1_24 = 2.625; [L43] double var_1_25 = 4.375; [L44] double var_1_26 = 2.35; [L45] double var_1_27 = 64.25; [L46] signed short int var_1_28 = -5; [L47] float var_1_29 = 0.0; [L48] unsigned char var_1_30 = 2; [L49] unsigned long int var_1_31 = 2; [L50] double last_1_var_1_1 = 50.75; [L51] unsigned char last_1_var_1_13 = 0; [L52] signed long int last_1_var_1_14 = 1; [L53] unsigned char last_1_var_1_15 = 128; [L54] unsigned char last_1_var_1_30 = 2; VAL [isInitial=0, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L181] isInitial = 1 [L182] FCALL initially() [L183] int k_loop; [L184] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L184] COND TRUE k_loop < 1 [L185] CALL updateLastVariables() [L170] last_1_var_1_1 = var_1_1 [L171] last_1_var_1_13 = var_1_13 [L172] last_1_var_1_14 = var_1_14 [L173] last_1_var_1_15 = var_1_15 [L174] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L135] var_1_3 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_3 >= -230584.3009213691390e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 2305843.009213691390e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not((var_1_3 >= -230584.3009213691390e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 2305843.009213691390e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L137] var_1_4 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_4 >= -230584.3009213691390e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 2305843.009213691390e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not((var_1_4 >= -230584.3009213691390e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 2305843.009213691390e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L141] var_1_8 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L145] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L150] var_1_16 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L153] var_1_17 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_18 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_18 <= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L159] var_1_22 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L162] var_1_26 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_26 >= 0.0F && 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_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_26 >= 0.0F && 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_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L164] var_1_27 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_27 >= 0.0F && 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_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_27 >= 0.0F && 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_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L166] var_1_29 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_29 >= 4611686.018427387900e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_29 >= 4611686.018427387900e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L58] EXPR last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L58] signed long int stepLocal_1 = last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))); [L59] COND FALSE !(last_1_var_1_14 > stepLocal_1) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L62] COND TRUE 99.3f <= var_1_3 [L63] var_1_25 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L68] COND TRUE var_1_25 <= var_1_4 [L69] var_1_15 = (var_1_16 - var_1_17) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L73] COND TRUE last_1_var_1_1 <= 2.25 [L74] var_1_1 = ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_10 = var_1_11 [L79] var_1_12 = (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5)))) [L80] var_1_23 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L81] COND TRUE 7.75 > (- var_1_12) [L82] var_1_24 = (var_1_3 + var_1_5) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L86] var_1_30 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L87] COND TRUE ((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5 [L88] var_1_21 = ((((var_1_22) < (5)) ? (var_1_22) : (5))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L90] COND FALSE !(var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) [L93] var_1_19 = (var_1_8 && var_1_9) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L95] COND FALSE !(var_1_24 > var_1_25) [L106] var_1_13 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L108] unsigned char stepLocal_0 = var_1_19 && var_1_8; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, stepLocal_0=0, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L109] COND FALSE !(var_1_9 || stepLocal_0) [L112] var_1_14 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L114] COND TRUE var_1_5 != (- var_1_4) [L115] var_1_6 = (var_1_19 && var_1_8) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L119] COND TRUE ((var_1_29 - 7.25f) - var_1_27) > var_1_23 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L120] COND TRUE var_1_26 != (var_1_23 * ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) [L121] var_1_28 = (var_1_14 + (((((var_1_16) > (var_1_13)) ? (var_1_16) : (var_1_13))) - (var_1_14 + var_1_11))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L132] var_1_31 = var_1_14 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L177] EXPR ((((((((((((last_1_var_1_1 <= 2.25) ? (var_1_1 == ((double) ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))))) : (var_1_1 == ((double) ((((((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) > (var_1_4)) ? (((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) : (var_1_4)))))) && ((var_1_5 != (- var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_19 && var_1_8))) : (var_1_6 == ((unsigned char) var_1_9)))) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5))))))) && ((var_1_24 > var_1_25) ? ((var_1_19 && var_1_9) ? ((var_1_11 > last_1_var_1_13) ? (var_1_13 == ((unsigned char) var_1_11)) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11)))) && ((var_1_9 || (var_1_19 && var_1_8)) ? (var_1_14 == ((signed long int) ((((((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) < (last_1_var_1_14)) ? (((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) : (last_1_var_1_14))))) : (var_1_14 == ((signed long int) last_1_var_1_14)))) && ((var_1_25 <= var_1_4) ? (var_1_15 == ((unsigned char) (var_1_16 - var_1_17))) : (var_1_15 == ((unsigned char) (var_1_17 + var_1_18))))) && ((var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) ? (var_1_19 == ((unsigned char) (var_1_8 || var_1_9))) : (var_1_19 == ((unsigned char) (var_1_8 && var_1_9))))) && ((((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5) ? (var_1_21 == ((signed char) ((((var_1_22) < (5)) ? (var_1_22) : (5))))) : 1)) && (var_1_23 == ((double) var_1_5))) && ((7.75 > (- var_1_12)) ? (var_1_24 == ((float) (var_1_3 + var_1_5))) : (var_1_24 == ((float) ((((9999.2f) < ((var_1_5 + var_1_4))) ? (9999.2f) : ((var_1_5 + var_1_4)))))))) && ((last_1_var_1_14 > (last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))))) ? (var_1_25 == ((double) ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) < (var_1_3)) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : (var_1_3))))) : ((99.3f <= var_1_3) ? (var_1_25 == ((double) (var_1_4 + var_1_5))) : (var_1_25 == ((double) (((((var_1_3 + (var_1_26 - var_1_27))) > (var_1_4)) ? ((var_1_3 + (var_1_26 - var_1_27))) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L177-L178] return (((((((((((((((last_1_var_1_1 <= 2.25) ? (var_1_1 == ((double) ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))))) : (var_1_1 == ((double) ((((((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) > (var_1_4)) ? (((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) : (var_1_4)))))) && ((var_1_5 != (- var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_19 && var_1_8))) : (var_1_6 == ((unsigned char) var_1_9)))) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5))))))) && ((var_1_24 > var_1_25) ? ((var_1_19 && var_1_9) ? ((var_1_11 > last_1_var_1_13) ? (var_1_13 == ((unsigned char) var_1_11)) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11)))) && ((var_1_9 || (var_1_19 && var_1_8)) ? (var_1_14 == ((signed long int) ((((((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) < (last_1_var_1_14)) ? (((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) : (last_1_var_1_14))))) : (var_1_14 == ((signed long int) last_1_var_1_14)))) && ((var_1_25 <= var_1_4) ? (var_1_15 == ((unsigned char) (var_1_16 - var_1_17))) : (var_1_15 == ((unsigned char) (var_1_17 + var_1_18))))) && ((var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) ? (var_1_19 == ((unsigned char) (var_1_8 || var_1_9))) : (var_1_19 == ((unsigned char) (var_1_8 && var_1_9))))) && ((((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5) ? (var_1_21 == ((signed char) ((((var_1_22) < (5)) ? (var_1_22) : (5))))) : 1)) && (var_1_23 == ((double) var_1_5))) && ((7.75 > (- var_1_12)) ? (var_1_24 == ((float) (var_1_3 + var_1_5))) : (var_1_24 == ((float) ((((9999.2f) < ((var_1_5 + var_1_4))) ? (9999.2f) : ((var_1_5 + var_1_4)))))))) && ((last_1_var_1_14 > (last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))))) ? (var_1_25 == ((double) ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) < (var_1_3)) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : (var_1_3))))) : ((99.3f <= var_1_3) ? (var_1_25 == ((double) (var_1_4 + var_1_5))) : (var_1_25 == ((double) (((((var_1_3 + (var_1_26 - var_1_27))) > (var_1_4)) ? ((var_1_3 + (var_1_26 - var_1_27))) : (var_1_4)))))))) && ((((var_1_29 - 7.25f) - var_1_27) > var_1_23) ? ((var_1_26 != (var_1_23 * ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))))) ? (var_1_28 == ((signed short int) (var_1_14 + (((((var_1_16) > (var_1_13)) ? (var_1_16) : (var_1_13))) - (var_1_14 + var_1_11))))) : (var_1_28 == ((signed short int) var_1_18))) : ((var_1_12 <= var_1_23) ? (var_1_28 == ((signed short int) var_1_17)) : (var_1_28 == ((signed short int) var_1_14))))) && (var_1_30 == ((unsigned char) var_1_11))) && (var_1_31 == ((unsigned long int) var_1_14)) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 1373 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 992 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 682 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 381 mSDtfsCounter, 682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 634 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 77 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 856 ConstructedInterpolants, 0 QuantifiedInterpolants, 3862 SizeOfPredicates, 9 NumberOfNonLiveVariables, 723 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4266/4560 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:03:30,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_loopvsstraightlinecode_100-1loop_file-42.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 aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:03:32,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:03:33,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:03:33,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:03:33,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:03:33,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:03:33,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:03:33,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:03:33,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:03:33,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:03:33,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:03:33,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:03:33,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:03:33,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:03:33,069 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:03:33,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:03:33,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:03:33,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:03:33,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:03:33,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:03:33,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:03:33,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:03:33,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:03:33,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:03:33,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:03:33,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:03:33,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:03:33,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:03:33,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:03:33,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:03:33,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:03:33,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:03:33,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:03:33,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:03:33,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:33,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:03:33,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:03:33,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:03:33,077 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:03:33,077 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:03:33,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:03:33,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:03:33,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:03:33,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:03:33,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> aeac736475d2e9b0ab566775f61df15337d707594a1ca30cedb7f4179e279e85 [2024-11-10 07:03:33,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:03:33,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:03:33,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:03:33,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:03:33,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:03:33,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2024-11-10 07:03:35,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:03:35,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:03:35,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-42.i [2024-11-10 07:03:35,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eddb3cd6/995a2899d08c4695973e3bb377da25a0/FLAG9936e41cf [2024-11-10 07:03:35,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eddb3cd6/995a2899d08c4695973e3bb377da25a0 [2024-11-10 07:03:35,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:03:35,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:03:35,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:35,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:03:35,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:03:35,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160869c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35, skipping insertion in model container [2024-11-10 07:03:35,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:03:35,576 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_loopvsstraightlinecode_100-1loop_file-42.i[916,929] [2024-11-10 07:03:35,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:35,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:03:35,704 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_loopvsstraightlinecode_100-1loop_file-42.i[916,929] [2024-11-10 07:03:35,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:35,794 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:03:35,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35 WrapperNode [2024-11-10 07:03:35,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:35,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:35,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:03:35,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:03:35,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,864 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-10 07:03:35,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:35,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:03:35,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:03:35,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:03:35,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,900 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]. [2024-11-10 07:03:35,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:03:35,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:03:35,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:03:35,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:03:35,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:35,971 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) [2024-11-10 07:03:35,976 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 [2024-11-10 07:03:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:03:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:03:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:03:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:03:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:03:36,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:03:36,093 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:03:36,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:03:52,188 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 07:03:52,189 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:03:52,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:03:52,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:03:52,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:52 BoogieIcfgContainer [2024-11-10 07:03:52,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:03:52,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:03:52,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:03:52,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:03:52,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:03:35" (1/3) ... [2024-11-10 07:03:52,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a3fd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:52, skipping insertion in model container [2024-11-10 07:03:52,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35" (2/3) ... [2024-11-10 07:03:52,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a3fd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:52, skipping insertion in model container [2024-11-10 07:03:52,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:52" (3/3) ... [2024-11-10 07:03:52,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-42.i [2024-11-10 07:03:52,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:03:52,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:03:52,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:03:52,297 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;@519c70fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:03:52,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:03:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:03:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 07:03:52,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:52,322 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:52,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:52,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash 670769744, now seen corresponding path program 1 times [2024-11-10 07:03:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:03:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747502817] [2024-11-10 07:03:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:52,348 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 [2024-11-10 07:03:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:03:52,351 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) [2024-11-10 07:03:52,353 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 [2024-11-10 07:03:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:53,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:03:53,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-10 07:03:53,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:03:53,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:03:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747502817] [2024-11-10 07:03:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747502817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:03:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672187966] [2024-11-10 07:03:53,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:03:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:03:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:03:53,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:53,379 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:03:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:53,417 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2024-11-10 07:03:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:03:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 139 [2024-11-10 07:03:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:53,428 INFO L225 Difference]: With dead ends: 144 [2024-11-10 07:03:53,429 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 07:03:53,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:53,437 INFO L432 NwaCegarLoop]: 107 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, 107 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 [2024-11-10 07:03:53,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:03:53,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 07:03:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 07:03:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:03:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-10 07:03:53,497 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 139 [2024-11-10 07:03:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:53,497 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-10 07:03:53,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:03:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-10 07:03:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 07:03:53,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:53,502 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:53,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:03:53,703 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 [2024-11-10 07:03:53,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1649270288, now seen corresponding path program 1 times [2024-11-10 07:03:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:03:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223878044] [2024-11-10 07:03:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:53,707 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 [2024-11-10 07:03:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:03:53,709 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) [2024-11-10 07:03:53,710 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 [2024-11-10 07:03:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:54,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:03:54,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:04:01,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:04:01,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223878044] [2024-11-10 07:04:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223878044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:04:01,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:04:01,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:04:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006388432] [2024-11-10 07:04:01,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:04:01,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:04:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:01,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:04:01,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:04:01,888 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:04:04,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:08,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:12,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 07:04:16,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:21,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 07:04:25,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:29,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:29,631 INFO L93 Difference]: Finished difference Result 203 states and 305 transitions. [2024-11-10 07:04:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:04:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-10 07:04:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:29,750 INFO L225 Difference]: With dead ends: 203 [2024-11-10 07:04:29,750 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 07:04:29,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:04:29,752 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:04:29,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 338 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 27.3s Time] [2024-11-10 07:04:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 07:04:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2024-11-10 07:04:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 07:04:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2024-11-10 07:04:29,778 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 139 [2024-11-10 07:04:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:29,779 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2024-11-10 07:04:29,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:04:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2024-11-10 07:04:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 07:04:29,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:29,782 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:04:29,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:04:29,983 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 [2024-11-10 07:04:29,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:29,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash 150998, now seen corresponding path program 1 times [2024-11-10 07:04:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:29,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985520850] [2024-11-10 07:04:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:29,985 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 [2024-11-10 07:04:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:29,989 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) [2024-11-10 07:04:29,993 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 [2024-11-10 07:04:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:30,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 07:04:30,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:04:34,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:04:34,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:34,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985520850] [2024-11-10 07:04:34,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985520850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:04:34,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:04:34,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:04:34,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011868163] [2024-11-10 07:04:34,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:04:34,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:04:34,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:04:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:04:34,410 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 07:04:40,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:42,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:45,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []