./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-34.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-while_file-34.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 c096c5b3e37732c880e99f350f4cb2d9214c8eea1247da7d7d353fb9735c198c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:13:10,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:13:10,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:13:10,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:13:10,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:13:10,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:13:10,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:13:10,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:13:10,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:13:10,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:13:10,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:13:10,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:13:10,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:13:10,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:13:10,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:13:10,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:13:10,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:13:10,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:13:10,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:13:10,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:13:10,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:13:10,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:13:10,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:13:10,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:13:10,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:13:10,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:13:10,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:13:10,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:13:10,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:13:10,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:13:10,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:13:10,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:13:10,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:13:10,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:13:10,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:13:10,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:13:10,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:13:10,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:13:10,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:13:10,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:13:10,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:13:10,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:13:10,931 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 -> c096c5b3e37732c880e99f350f4cb2d9214c8eea1247da7d7d353fb9735c198c [2024-11-10 07:13:11,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:13:11,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:13:11,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:13:11,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:13:11,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:13:11,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-34.i [2024-11-10 07:13:12,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:13:12,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:13:12,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-34.i [2024-11-10 07:13:12,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78adc24e/f20050e6d5bb48a1a89ec9a3be564ee8/FLAGfb028fd1a [2024-11-10 07:13:12,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78adc24e/f20050e6d5bb48a1a89ec9a3be564ee8 [2024-11-10 07:13:12,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:13:12,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:13:12,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:13:12,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:13:12,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:13:12,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:12" (1/1) ... [2024-11-10 07:13:12,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f81284a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:12, skipping insertion in model container [2024-11-10 07:13:12,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:12" (1/1) ... [2024-11-10 07:13:12,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:13:13,101 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-while_file-34.i[916,929] [2024-11-10 07:13:13,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:13:13,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:13:13,226 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-while_file-34.i[916,929] [2024-11-10 07:13:13,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:13:13,272 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:13:13,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13 WrapperNode [2024-11-10 07:13:13,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:13:13,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:13:13,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:13:13,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:13:13,281 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:13:13" (1/1) ... [2024-11-10 07:13:13,289 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:13:13" (1/1) ... [2024-11-10 07:13:13,314 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-10 07:13:13,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:13:13,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:13:13,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:13:13,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:13:13,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,340 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:13:13,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:13:13,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:13:13,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:13:13,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:13:13,358 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (1/1) ... [2024-11-10 07:13:13,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:13:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:13,388 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:13:13,395 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:13:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:13:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:13:13,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:13:13,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:13:13,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:13:13,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:13:13,507 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:13:13,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:13:13,856 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 07:13:13,857 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:13:13,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:13:13,872 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:13:13,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:13 BoogieIcfgContainer [2024-11-10 07:13:13,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:13:13,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:13:13,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:13:13,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:13:13,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:13:12" (1/3) ... [2024-11-10 07:13:13,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c737ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:13, skipping insertion in model container [2024-11-10 07:13:13,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:13" (2/3) ... [2024-11-10 07:13:13,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c737ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:13, skipping insertion in model container [2024-11-10 07:13:13,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:13" (3/3) ... [2024-11-10 07:13:13,881 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-34.i [2024-11-10 07:13:13,893 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:13:13,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:13:13,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:13:13,950 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;@68b2cb53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:13:13,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:13:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 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:13:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:13:13,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:13,966 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:13:13,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash -31472457, now seen corresponding path program 1 times [2024-11-10 07:13:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938833136] [2024-11-10 07:13:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:14,373 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:13:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938833136] [2024-11-10 07:13:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938833136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:14,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:13:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656528459] [2024-11-10 07:13:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:14,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:13:14,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:14,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:13:14,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:13:14,401 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 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.5) internal successors, (47), 2 states have internal predecessors, (47), 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:13:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:14,431 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-10 07:13:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:13:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 144 [2024-11-10 07:13:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:14,440 INFO L225 Difference]: With dead ends: 158 [2024-11-10 07:13:14,440 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 07:13:14,443 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:13:14,448 INFO L432 NwaCegarLoop]: 118 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, 118 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:13:14,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:13:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 07:13:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 07:13:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 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:13:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 07:13:14,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 144 [2024-11-10 07:13:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:14,498 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 07:13:14,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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:13:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 07:13:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:13:14,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:14,503 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:13:14,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:13:14,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:14,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1379505123, now seen corresponding path program 1 times [2024-11-10 07:13:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617362883] [2024-11-10 07:13:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:15,688 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:13:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617362883] [2024-11-10 07:13:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617362883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:13:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706972640] [2024-11-10 07:13:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:13:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:13:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:13:15,692 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:13:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:16,206 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2024-11-10 07:13:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:13:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 144 [2024-11-10 07:13:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:16,211 INFO L225 Difference]: With dead ends: 355 [2024-11-10 07:13:16,211 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 07:13:16,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:13:16,215 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 396 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:16,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 554 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:13:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 07:13:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 199. [2024-11-10 07:13:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 143 states have internal predecessors, (194), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 07:13:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2024-11-10 07:13:16,254 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 144 [2024-11-10 07:13:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2024-11-10 07:13:16,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:13:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2024-11-10 07:13:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:13:16,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:16,257 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:13:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:13:16,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:16,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2103075005, now seen corresponding path program 1 times [2024-11-10 07:13:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:16,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593758187] [2024-11-10 07:13:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,066 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:13:17,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593758187] [2024-11-10 07:13:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593758187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:17,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:17,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 07:13:17,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268520035] [2024-11-10 07:13:17,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:17,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:13:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:13:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:13:17,069 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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:13:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:17,569 INFO L93 Difference]: Finished difference Result 387 states and 567 transitions. [2024-11-10 07:13:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 07:13:17,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 144 [2024-11-10 07:13:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:17,579 INFO L225 Difference]: With dead ends: 387 [2024-11-10 07:13:17,579 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 07:13:17,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:13:17,582 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 389 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:17,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 621 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:13:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 07:13:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 200. [2024-11-10 07:13:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 144 states have internal predecessors, (195), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 07:13:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2024-11-10 07:13:17,609 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 144 [2024-11-10 07:13:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:17,611 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2024-11-10 07:13:17,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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:13:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2024-11-10 07:13:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:13:17,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:17,622 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:13:17,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:13:17,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:17,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:17,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1304388610, now seen corresponding path program 1 times [2024-11-10 07:13:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:17,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206069309] [2024-11-10 07:13:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:17,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 07:13:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206069309] [2024-11-10 07:13:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206069309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:13:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007407613] [2024-11-10 07:13:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:18,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:18,048 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:13:18,049 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:13:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:18,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 07:13:18,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:13:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-10 07:13:18,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:13:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-10 07:13:18,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007407613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:13:18,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:13:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-10 07:13:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424124180] [2024-11-10 07:13:18,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:13:18,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 07:13:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 07:13:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-10 07:13:18,695 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-10 07:13:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:20,501 INFO L93 Difference]: Finished difference Result 846 states and 1225 transitions. [2024-11-10 07:13:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-10 07:13:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 144 [2024-11-10 07:13:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:20,509 INFO L225 Difference]: With dead ends: 846 [2024-11-10 07:13:20,509 INFO L226 Difference]: Without dead ends: 711 [2024-11-10 07:13:20,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 331 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1427, Invalid=5545, Unknown=0, NotChecked=0, Total=6972 [2024-11-10 07:13:20,512 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2079 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:20,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 655 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:13:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-10 07:13:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 346. [2024-11-10 07:13:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 229 states have (on average 1.240174672489083) internal successors, (284), 230 states have internal predecessors, (284), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-10 07:13:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-10 07:13:20,551 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 144 [2024-11-10 07:13:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:20,551 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-10 07:13:20,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-10 07:13:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-10 07:13:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:13:20,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:20,553 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, 1] [2024-11-10 07:13:20,567 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:13:20,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:20,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -133966361, now seen corresponding path program 1 times [2024-11-10 07:13:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259416435] [2024-11-10 07:13:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 07:13:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259416435] [2024-11-10 07:13:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259416435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:13:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843786708] [2024-11-10 07:13:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:21,043 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:13:21,044 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:13:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:21,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:13:21,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:13:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-10 07:13:21,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:13:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 07:13:21,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843786708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:13:21,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:13:21,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-10 07:13:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540407345] [2024-11-10 07:13:21,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:13:21,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 07:13:21,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 07:13:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:13:21,339 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:13:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:21,707 INFO L93 Difference]: Finished difference Result 556 states and 769 transitions. [2024-11-10 07:13:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 07:13:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-10 07:13:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:21,709 INFO L225 Difference]: With dead ends: 556 [2024-11-10 07:13:21,710 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 07:13:21,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2024-11-10 07:13:21,711 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 195 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:21,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 614 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:13:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 07:13:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2024-11-10 07:13:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 164 states have internal predecessors, (203), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 07:13:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2024-11-10 07:13:21,735 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 145 [2024-11-10 07:13:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2024-11-10 07:13:21,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:13:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2024-11-10 07:13:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:13:21,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:21,738 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, 1] [2024-11-10 07:13:21,753 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:13:21,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:21,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:21,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:21,939 INFO L85 PathProgramCache]: Analyzing trace with hash -639524986, now seen corresponding path program 1 times [2024-11-10 07:13:21,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:21,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422450365] [2024-11-10 07:13:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 07:13:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422450365] [2024-11-10 07:13:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422450365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:13:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570440384] [2024-11-10 07:13:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:22,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:22,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:22,376 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:13:22,377 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:13:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:22,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 07:13:22,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:13:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 440 proven. 33 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-10 07:13:22,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:13:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-10 07:13:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570440384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:13:23,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:13:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 31 [2024-11-10 07:13:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325688604] [2024-11-10 07:13:23,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:13:23,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 07:13:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 07:13:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2024-11-10 07:13:23,471 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-10 07:13:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:25,245 INFO L93 Difference]: Finished difference Result 648 states and 854 transitions. [2024-11-10 07:13:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-10 07:13:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) Word has length 145 [2024-11-10 07:13:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:25,247 INFO L225 Difference]: With dead ends: 648 [2024-11-10 07:13:25,247 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 07:13:25,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1371, Invalid=6461, Unknown=0, NotChecked=0, Total=7832 [2024-11-10 07:13:25,250 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1498 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:25,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1230 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 07:13:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 07:13:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 260. [2024-11-10 07:13:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 178 states have (on average 1.1741573033707866) internal successors, (209), 178 states have internal predecessors, (209), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 07:13:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 329 transitions. [2024-11-10 07:13:25,281 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 329 transitions. Word has length 145 [2024-11-10 07:13:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:25,281 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 329 transitions. [2024-11-10 07:13:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-10 07:13:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 329 transitions. [2024-11-10 07:13:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:13:25,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:25,283 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, 1] [2024-11-10 07:13:25,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 07:13:25,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:13:25,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1451912154, now seen corresponding path program 1 times [2024-11-10 07:13:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064161736] [2024-11-10 07:13:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:13:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:13:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:13:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:13:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:13:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:13:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:13:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:13:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:13:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:13:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:13:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:13:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:13:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:13:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:13:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:13:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 07:13:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 07:13:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 07:13:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:13:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:25,731 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:13:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:13:25,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064161736] [2024-11-10 07:13:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064161736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:25,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:13:25,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544591289] [2024-11-10 07:13:25,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:25,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:13:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:13:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:13:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:13:25,733 INFO L87 Difference]: Start difference. First operand 260 states and 329 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:13:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:25,814 INFO L93 Difference]: Finished difference Result 447 states and 568 transitions. [2024-11-10 07:13:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:13:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 145 [2024-11-10 07:13:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:25,816 INFO L225 Difference]: With dead ends: 447 [2024-11-10 07:13:25,816 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 07:13:25,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:13:25,817 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:13:25,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 254 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:13:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 07:13:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-10 07:13:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 178 states have internal predecessors, (207), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 07:13:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 327 transitions. [2024-11-10 07:13:25,848 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 327 transitions. Word has length 145 [2024-11-10 07:13:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:25,848 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 327 transitions. [2024-11-10 07:13:25,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:13:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 327 transitions. [2024-11-10 07:13:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:13:25,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:25,850 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, 1] [2024-11-10 07:13:25,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:13:25,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:25,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash -564408473, now seen corresponding path program 1 times [2024-11-10 07:13:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:13:25,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927117344] [2024-11-10 07:13:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:13:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:13:25,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:13:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:13:25,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:13:25,959 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:13:25,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:13:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:13:25,963 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:13:26,051 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:13:26,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:13:26 BoogieIcfgContainer [2024-11-10 07:13:26,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:13:26,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:13:26,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:13:26,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:13:26,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:13" (3/4) ... [2024-11-10 07:13:26,058 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:13:26,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:13:26,059 INFO L158 Benchmark]: Toolchain (without parser) took 13117.53ms. Allocated memory was 174.1MB in the beginning and 308.3MB in the end (delta: 134.2MB). Free memory was 109.0MB in the beginning and 200.8MB in the end (delta: -91.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-11-10 07:13:26,059 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:13:26,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.10ms. Allocated memory is still 174.1MB. Free memory was 109.0MB in the beginning and 136.5MB in the end (delta: -27.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:13:26,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.83ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 132.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:13:26,060 INFO L158 Benchmark]: Boogie Preprocessor took 41.84ms. Allocated memory is still 174.1MB. Free memory was 132.3MB in the beginning and 127.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:13:26,060 INFO L158 Benchmark]: IcfgBuilder took 514.95ms. Allocated memory is still 174.1MB. Free memory was 127.6MB in the beginning and 102.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 07:13:26,060 INFO L158 Benchmark]: TraceAbstraction took 12180.01ms. Allocated memory was 174.1MB in the beginning and 308.3MB in the end (delta: 134.2MB). Free memory was 102.4MB in the beginning and 200.8MB in the end (delta: -98.4MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-10 07:13:26,061 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 308.3MB. Free memory is still 200.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:13:26,062 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.14ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.10ms. Allocated memory is still 174.1MB. Free memory was 109.0MB in the beginning and 136.5MB in the end (delta: -27.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.83ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 132.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.84ms. Allocated memory is still 174.1MB. Free memory was 132.3MB in the beginning and 127.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 514.95ms. Allocated memory is still 174.1MB. Free memory was 127.6MB in the beginning and 102.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12180.01ms. Allocated memory was 174.1MB in the beginning and 308.3MB in the end (delta: 134.2MB). Free memory was 102.4MB in the beginning and 200.8MB in the end (delta: -98.4MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 308.3MB. Free memory is still 200.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned char var_1_3 = 200; [L24] unsigned char var_1_4 = 16; [L25] unsigned char var_1_5 = 0; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 64.75; [L28] double var_1_9 = 1.625; [L29] double var_1_10 = 0.0; [L30] double var_1_11 = 15.75; [L31] double var_1_12 = 199.6; [L32] double var_1_13 = 31.625; [L33] float var_1_14 = 2.575; [L34] float var_1_15 = 0.0; [L35] double var_1_16 = 64.8; [L36] double var_1_18 = 8.01; [L37] double var_1_19 = 1000000.5; [L38] unsigned char var_1_22 = 1; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] double var_1_26 = 49.31; [L43] signed long int var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 1; [L47] unsigned short int last_1_var_1_1 = 64; [L48] unsigned char last_1_var_1_22 = 1; [L49] signed long int last_1_var_1_28 = 1; [L50] unsigned char last_1_var_1_29 = 1; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_22 = var_1_22 [L180] last_1_var_1_28 = var_1_28 [L181] last_1_var_1_29 = var_1_29 [L182] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L144] RET assume_abort_if_not(var_1_3 >= 191) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] CALL assume_abort_if_not(var_1_4 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] RET assume_abort_if_not(var_1_4 <= 64) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L152] var_1_8 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L153] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L154] var_1_10 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L155] RET assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L156] var_1_11 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L157] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L160] var_1_15 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L161] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L162] var_1_18 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L163] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L174] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L193] RET updateVariables() [L194] CALL step() [L55] COND FALSE !(var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L62] signed long int stepLocal_7 = 100; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L63] COND TRUE ! (var_1_10 <= 16.8) [L64] var_1_29 = (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L74] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=-192, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L75] COND TRUE stepLocal_1 >= var_1_28 [L76] var_1_7 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L78] unsigned char stepLocal_4 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_4=-192, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L79] COND TRUE stepLocal_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) [L80] var_1_14 = ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L84] COND TRUE (- var_1_7) == var_1_10 [L85] var_1_16 = (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L87] var_1_31 = var_1_25 [L88] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L89] COND TRUE \read(var_1_29) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L90] COND TRUE ((var_1_3 - var_1_4) - var_1_5) <= stepLocal_0 [L91] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L94] unsigned char stepLocal_6 = var_1_31; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_6=-256, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L95] COND FALSE !(var_1_31 && stepLocal_6) [L98] var_1_22 = (! (var_1_24 && (! var_1_25))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L105] COND TRUE var_1_12 == var_1_8 [L106] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L111] unsigned char stepLocal_3 = var_1_3; [L112] unsigned char stepLocal_2 = var_1_10 != var_1_9; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_2=0, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L113] COND FALSE !(stepLocal_2 && var_1_29) [L124] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L126] unsigned char stepLocal_5 = var_1_22; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_5=0, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L127] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_5=0, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L134] COND FALSE !(stepLocal_5 || var_1_22) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L138] COND TRUE var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1) [L139] var_1_26 = 25.5 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return (((((((((((var_1_29 ? ((((var_1_3 - var_1_4) - var_1_5) <= var_1_28) ? (var_1_1 == ((unsigned short int) var_1_3)) : 1) : 1) && ((var_1_4 >= var_1_28) ? (var_1_7 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_22 ? ((var_1_1 >= var_1_5) ? (var_1_9 == ((double) ((((((var_1_10 - var_1_11) - var_1_12)) < (var_1_8)) ? (((var_1_10 - var_1_11) - var_1_12)) : (var_1_8))))) : 1) : ((var_1_12 == var_1_8) ? (var_1_9 == ((double) var_1_11)) : (var_1_9 == ((double) var_1_12))))) && (((var_1_10 != var_1_9) && var_1_29) ? ((var_1_11 >= (127.5 / var_1_10)) ? ((var_1_3 >= var_1_28) ? (var_1_13 == ((double) var_1_10)) : (var_1_13 == ((double) 9.9999999999996E12))) : (var_1_13 == ((double) var_1_11))) : (var_1_13 == ((double) var_1_12)))) && ((var_1_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) ? (var_1_14 == ((float) ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))))) : (var_1_14 == ((float) var_1_15)))) && (((- var_1_7) == var_1_10) ? (var_1_16 == ((double) (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))))) : 1)) && (var_1_22 ? ((var_1_10 >= (var_1_8 * var_1_13)) ? (var_1_19 == ((double) (var_1_18 - (var_1_15 - var_1_11)))) : (var_1_19 == ((double) ((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) : ((var_1_22 || var_1_22) ? (var_1_19 == ((double) var_1_12)) : 1))) && ((var_1_31 && var_1_31) ? (var_1_22 == ((unsigned char) ((var_1_29 || var_1_23) && var_1_24))) : (var_1_22 == ((unsigned char) (! (var_1_24 && (! var_1_25))))))) && ((var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1)) ? (var_1_26 == ((double) 25.5)) : 1)) && ((var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) ? ((last_1_var_1_29 && last_1_var_1_31) ? (var_1_28 == ((signed long int) last_1_var_1_1)) : (var_1_28 == ((signed long int) last_1_var_1_1))) : 1)) && ((! (var_1_10 <= 16.8)) ? (var_1_29 == ((unsigned char) (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)))) : (((last_1_var_1_28 * (- 2)) <= 100) ? (last_1_var_1_22 ? (var_1_29 == ((unsigned char) 0)) : (var_1_29 == ((unsigned char) (var_1_23 && var_1_24)))) : 1))) && (var_1_31 == ((unsigned char) var_1_25)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4692 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4645 mSDsluCounter, 4046 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3132 mSDsCounter, 1931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2704 IncrementalHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1931 mSolverCounterUnsat, 914 mSDtfsCounter, 2704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1396 GetRequests, 1172 SyntacticMatches, 3 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5137 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=4, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 763 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1866 ConstructedInterpolants, 0 QuantifiedInterpolants, 6761 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1070 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 9703/9880 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:13:26,091 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-while_file-34.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 c096c5b3e37732c880e99f350f4cb2d9214c8eea1247da7d7d353fb9735c198c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:13:27,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:13:27,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:13:27,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:13:27,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:13:27,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:13:27,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:13:27,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:13:27,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:13:27,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:13:27,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:13:27,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:13:27,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:13:27,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:13:27,999 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:13:28,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:13:28,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:13:28,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:13:28,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:13:28,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:13:28,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:13:28,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:13:28,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:13:28,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:13:28,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:13:28,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:13:28,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:13:28,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:13:28,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:13:28,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:13:28,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:13:28,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:13:28,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:13:28,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:13:28,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:13:28,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:13:28,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:13:28,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:13:28,006 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:13:28,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:13:28,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:13:28,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:13:28,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:13:28,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:13:28,007 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 -> c096c5b3e37732c880e99f350f4cb2d9214c8eea1247da7d7d353fb9735c198c [2024-11-10 07:13:28,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:13:28,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:13:28,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:13:28,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:13:28,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:13:28,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-34.i [2024-11-10 07:13:29,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:13:29,807 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:13:29,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-34.i [2024-11-10 07:13:29,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8098bfc/7f6a9d37805447db92a1e8a603d9ac8c/FLAG50a11ee0c [2024-11-10 07:13:30,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8098bfc/7f6a9d37805447db92a1e8a603d9ac8c [2024-11-10 07:13:30,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:13:30,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:13:30,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:13:30,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:13:30,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:13:30,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31025291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30, skipping insertion in model container [2024-11-10 07:13:30,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:13:30,361 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-while_file-34.i[916,929] [2024-11-10 07:13:30,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:13:30,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:13:30,469 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-while_file-34.i[916,929] [2024-11-10 07:13:30,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:13:30,538 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:13:30,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30 WrapperNode [2024-11-10 07:13:30,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:13:30,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:13:30,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:13:30,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:13:30,546 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:13:30" (1/1) ... [2024-11-10 07:13:30,562 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:13:30" (1/1) ... [2024-11-10 07:13:30,597 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-10 07:13:30,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:13:30,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:13:30,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:13:30,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:13:30,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,632 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:13:30,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:13:30,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:13:30,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:13:30,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:13:30,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (1/1) ... [2024-11-10 07:13:30,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:13:30,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:13:30,698 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:13:30,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:13:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:13:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:13:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:13:30,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:13:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:13:30,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:13:30,831 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:13:30,833 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:13:50,845 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 07:13:50,846 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:13:50,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:13:50,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:13:50,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:50 BoogieIcfgContainer [2024-11-10 07:13:50,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:13:50,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:13:50,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:13:50,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:13:50,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:13:30" (1/3) ... [2024-11-10 07:13:50,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13030915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:50, skipping insertion in model container [2024-11-10 07:13:50,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:30" (2/3) ... [2024-11-10 07:13:50,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13030915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:50, skipping insertion in model container [2024-11-10 07:13:50,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:13:50" (3/3) ... [2024-11-10 07:13:50,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-34.i [2024-11-10 07:13:50,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:13:50,878 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:13:50,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:13:50,928 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;@b831b64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:13:50,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:13:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 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:13:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:13:50,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:50,940 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:13:50,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:50,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash -31472457, now seen corresponding path program 1 times [2024-11-10 07:13:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:13:50,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110209684] [2024-11-10 07:13:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:50,953 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:13:50,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:13:50,954 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:13:50,955 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:13:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:52,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:13:52,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:13:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-10 07:13:52,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:13:52,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:13:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110209684] [2024-11-10 07:13:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110209684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:13:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:13:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:13:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335608582] [2024-11-10 07:13:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:13:52,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:13:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:13:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:13:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:13:52,287 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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:13:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:13:52,309 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-10 07:13:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:13:52,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 144 [2024-11-10 07:13:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:13:52,320 INFO L225 Difference]: With dead ends: 158 [2024-11-10 07:13:52,320 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 07:13:52,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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:13:52,324 INFO L432 NwaCegarLoop]: 118 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, 118 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:13:52,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:13:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 07:13:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 07:13:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 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:13:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 07:13:52,353 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 144 [2024-11-10 07:13:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:13:52,353 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 07:13:52,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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:13:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 07:13:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 07:13:52,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:13:52,356 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:13:52,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:13:52,558 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:13:52,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:13:52,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:13:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1379505123, now seen corresponding path program 1 times [2024-11-10 07:13:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:13:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001095063] [2024-11-10 07:13:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:13:52,560 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:13:52,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:13:52,562 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:13:52,563 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:13:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:13:53,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 07:13:53,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-10 07:14:00,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 07:14:06,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:14:06,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001095063] [2024-11-10 07:14:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001095063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:06,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:14:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-10 07:14:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101781976] [2024-11-10 07:14:06,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:14:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:14:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:14:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:14:06,509 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-10 07:14:17,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:14:21,649 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:14:25,662 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:14:29,678 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:14:33,687 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:14:37,701 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:14:41,704 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:14:45,708 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 []