./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:28:59,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:28:59,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:28:59,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:28:59,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:29:00,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:29:00,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:29:00,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:29:00,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:29:00,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:29:00,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:29:00,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:29:00,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:29:00,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:29:00,041 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:29:00,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:29:00,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:29:00,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:29:00,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:29:00,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:29:00,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:29:00,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:29:00,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:29:00,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:29:00,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:29:00,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:29:00,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:29:00,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:29:00,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:29:00,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:29:00,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:29:00,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:29:00,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:29:00,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:29:00,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:29:00,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:29:00,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:29:00,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:29:00,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:29:00,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:29:00,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:29:00,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:29:00,050 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-10-24 05:29:00,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:29:00,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:29:00,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:29:00,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:29:00,342 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:29:00,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-24 05:29:01,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:29:02,019 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:29:02,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-24 05:29:02,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dbf0ea8/3357cc1b076549ce946952843aecb651/FLAG7da6f54b1 [2024-10-24 05:29:02,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dbf0ea8/3357cc1b076549ce946952843aecb651 [2024-10-24 05:29:02,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:29:02,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:29:02,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:29:02,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:29:02,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:29:02,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b9773e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02, skipping insertion in model container [2024-10-24 05:29:02,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:29:02,277 WARN L248 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_codestructure_steplocals_file-21.i[917,930] [2024-10-24 05:29:02,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:29:02,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:29:02,406 WARN L248 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_codestructure_steplocals_file-21.i[917,930] [2024-10-24 05:29:02,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:29:02,487 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:29:02,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02 WrapperNode [2024-10-24 05:29:02,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:29:02,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:29:02,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:29:02,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:29:02,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,580 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-24 05:29:02,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:29:02,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:29:02,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:29:02,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:29:02,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:29:02,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:29:02,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:29:02,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:29:02,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:29:02,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (1/1) ... [2024-10-24 05:29:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:29:02,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:29:02,724 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-10-24 05:29:02,728 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-10-24 05:29:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:29:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:29:02,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:29:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:29:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:29:02,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:29:02,876 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:29:02,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:29:03,222 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-24 05:29:03,223 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:29:03,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:29:03,259 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:29:03,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:29:03 BoogieIcfgContainer [2024-10-24 05:29:03,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:29:03,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:29:03,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:29:03,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:29:03,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:29:02" (1/3) ... [2024-10-24 05:29:03,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec8f9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:29:03, skipping insertion in model container [2024-10-24 05:29:03,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:02" (2/3) ... [2024-10-24 05:29:03,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec8f9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:29:03, skipping insertion in model container [2024-10-24 05:29:03,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:29:03" (3/3) ... [2024-10-24 05:29:03,267 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-10-24 05:29:03,280 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:29:03,280 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:29:03,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:29:03,351 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;@2867a4cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:29:03,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:29:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 05:29:03,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:03,369 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:03,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:03,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash 950371602, now seen corresponding path program 1 times [2024-10-24 05:29:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:29:03,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061797534] [2024-10-24 05:29:03,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:29:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:29:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:29:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:29:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:29:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:29:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:29:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:29:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:29:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:29:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:29:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:29:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:29:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:29:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:29:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:29:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:29:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:29:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:29:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:29:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:29:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:29:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:29:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:29:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:29:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:29:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:29:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 05:29:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 05:29:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 05:29:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:29:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:29:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:29:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 05:29:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:29:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061797534] [2024-10-24 05:29:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061797534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:29:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:29:03,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:29:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208409607] [2024-10-24 05:29:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:29:03,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:29:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:29:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:29:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:29:03,749 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 05:29:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:29:03,803 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-10-24 05:29:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:29:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 194 [2024-10-24 05:29:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:29:03,815 INFO L225 Difference]: With dead ends: 161 [2024-10-24 05:29:03,816 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 05:29:03,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-10-24 05:29:03,827 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:29:03,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:29:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 05:29:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 05:29:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-24 05:29:03,946 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 194 [2024-10-24 05:29:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:29:03,947 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-24 05:29:03,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 05:29:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-24 05:29:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 05:29:03,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:03,958 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:03,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:29:03,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -668326134, now seen corresponding path program 1 times [2024-10-24 05:29:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:29:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400045675] [2024-10-24 05:29:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:29:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:29:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:29:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:29:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:29:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:29:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:29:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:29:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:29:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:29:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:29:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:29:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:29:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:29:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:29:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:29:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:29:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:29:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:29:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:29:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:29:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:29:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:29:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:29:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:29:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:29:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:29:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 05:29:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 05:29:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 05:29:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:29:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:29:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:29:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 05:29:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:29:14,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400045675] [2024-10-24 05:29:14,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400045675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:29:14,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:29:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:29:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301091637] [2024-10-24 05:29:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:29:14,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:29:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:29:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:29:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:29:14,726 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:29:15,321 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2024-10-24 05:29:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:29:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-24 05:29:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:29:15,327 INFO L225 Difference]: With dead ends: 205 [2024-10-24 05:29:15,327 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 05:29:15,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:29:15,335 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 54 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:29:15,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 419 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:29:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 05:29:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2024-10-24 05:29:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2024-10-24 05:29:15,373 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 194 [2024-10-24 05:29:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:29:15,379 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2024-10-24 05:29:15,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2024-10-24 05:29:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 05:29:15,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:15,389 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:15,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:29:15,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:15,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash -410160696, now seen corresponding path program 1 times [2024-10-24 05:29:15,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:29:15,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590817678] [2024-10-24 05:29:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:29:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:29:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:29:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:29:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:29:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:29:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:29:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:29:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:29:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:29:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:29:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:29:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:29:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:29:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:29:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:29:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:29:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:29:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:29:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:29:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:29:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:29:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:29:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:29:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:29:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:29:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:29:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 05:29:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 05:29:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 05:29:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:29:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:29:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:29:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 05:29:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:29:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590817678] [2024-10-24 05:29:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590817678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:29:20,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:29:20,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:29:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086290949] [2024-10-24 05:29:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:29:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:29:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:29:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:29:20,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:29:20,853 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:29:21,351 INFO L93 Difference]: Finished difference Result 207 states and 314 transitions. [2024-10-24 05:29:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:29:21,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-24 05:29:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:29:21,354 INFO L225 Difference]: With dead ends: 207 [2024-10-24 05:29:21,354 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 05:29:21,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:29:21,356 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 46 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:29:21,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 445 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:29:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 05:29:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2024-10-24 05:29:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2024-10-24 05:29:21,368 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 194 [2024-10-24 05:29:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:29:21,369 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2024-10-24 05:29:21,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2024-10-24 05:29:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 05:29:21,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:21,371 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:21,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:29:21,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:21,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1679443384, now seen corresponding path program 1 times [2024-10-24 05:29:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:29:21,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819238529] [2024-10-24 05:29:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:29:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:29:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:29:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:29:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:29:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:29:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:29:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:29:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:29:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:29:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:29:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:29:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:29:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:29:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:29:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:29:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:29:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:29:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:29:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:29:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:29:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:29:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:29:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:29:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:29:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:29:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:29:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 05:29:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 05:29:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 05:29:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:29:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:29:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:29:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 05:29:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:29:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819238529] [2024-10-24 05:29:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819238529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:29:21,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:29:21,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:29:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966837177] [2024-10-24 05:29:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:29:21,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:29:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:29:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:29:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:29:21,547 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:29:21,620 INFO L93 Difference]: Finished difference Result 196 states and 296 transitions. [2024-10-24 05:29:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:29:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-24 05:29:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:29:21,624 INFO L225 Difference]: With dead ends: 196 [2024-10-24 05:29:21,624 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 05:29:21,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:29:21,629 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 32 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:29:21,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 525 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:29:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 05:29:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2024-10-24 05:29:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-10-24 05:29:21,647 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 194 [2024-10-24 05:29:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:29:21,649 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-10-24 05:29:21,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-10-24 05:29:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 05:29:21,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:21,652 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:21,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:29:21,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:21,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:21,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1421277946, now seen corresponding path program 1 times [2024-10-24 05:29:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:29:21,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804523688] [2024-10-24 05:29:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:29:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:29:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:29:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:29:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:29:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:29:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:29:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:29:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:29:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:29:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:29:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:29:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:29:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:29:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:29:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:29:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:29:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:29:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:29:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:29:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:29:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:29:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:29:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:29:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:29:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:29:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:29:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 05:29:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 05:29:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 05:29:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:29:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 05:29:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:29:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 05:29:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:29:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804523688] [2024-10-24 05:29:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804523688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:29:25,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:29:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:29:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202579635] [2024-10-24 05:29:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:29:25,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:29:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:29:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:29:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:29:25,842 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:29:26,237 INFO L93 Difference]: Finished difference Result 196 states and 294 transitions. [2024-10-24 05:29:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:29:26,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 194 [2024-10-24 05:29:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:29:26,240 INFO L225 Difference]: With dead ends: 196 [2024-10-24 05:29:26,240 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 05:29:26,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:29:26,242 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 54 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:29:26,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 525 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:29:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 05:29:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2024-10-24 05:29:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2024-10-24 05:29:26,249 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 194 [2024-10-24 05:29:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:29:26,249 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2024-10-24 05:29:26,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 05:29:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2024-10-24 05:29:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 05:29:26,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:26,251 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:29:26,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1400761881, now seen corresponding path program 1 times [2024-10-24 05:29:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:29:26,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753540043] [2024-10-24 05:29:26,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:29:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:29:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477811911] [2024-10-24 05:29:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:26,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:29:26,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:29:26,330 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-10-24 05:29:26,333 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-10-24 05:29:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:29:26,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:29:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:29:26,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:29:26,644 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:29:26,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:29:26,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:29:26,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 05:29:26,851 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 05:29:26,954 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:29:26,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:29:26 BoogieIcfgContainer [2024-10-24 05:29:26,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:29:26,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:29:26,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:29:26,957 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:29:26,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:29:03" (3/4) ... [2024-10-24 05:29:26,958 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:29:26,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:29:26,960 INFO L158 Benchmark]: Toolchain (without parser) took 24911.05ms. Allocated memory was 146.8MB in the beginning and 1.0GB in the end (delta: 889.2MB). Free memory was 79.2MB in the beginning and 477.6MB in the end (delta: -398.5MB). Peak memory consumption was 492.3MB. Max. memory is 16.1GB. [2024-10-24 05:29:26,960 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 146.8MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:29:26,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.96ms. Allocated memory is still 146.8MB. Free memory was 79.2MB in the beginning and 62.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:29:26,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.06ms. Allocated memory is still 146.8MB. Free memory was 62.3MB in the beginning and 57.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:29:26,961 INFO L158 Benchmark]: Boogie Preprocessor took 101.17ms. Allocated memory is still 146.8MB. Free memory was 57.8MB in the beginning and 51.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:29:26,961 INFO L158 Benchmark]: RCFGBuilder took 574.02ms. Allocated memory was 146.8MB in the beginning and 291.5MB in the end (delta: 144.7MB). Free memory was 50.9MB in the beginning and 238.0MB in the end (delta: -187.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-24 05:29:26,961 INFO L158 Benchmark]: TraceAbstraction took 23694.77ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 744.5MB). Free memory was 238.0MB in the beginning and 477.6MB in the end (delta: -239.7MB). Peak memory consumption was 503.8MB. Max. memory is 16.1GB. [2024-10-24 05:29:26,961 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 1.0GB. Free memory is still 477.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:29:26,963 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.29ms. Allocated memory is still 146.8MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.96ms. Allocated memory is still 146.8MB. Free memory was 79.2MB in the beginning and 62.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.06ms. Allocated memory is still 146.8MB. Free memory was 62.3MB in the beginning and 57.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.17ms. Allocated memory is still 146.8MB. Free memory was 57.8MB in the beginning and 51.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 574.02ms. Allocated memory was 146.8MB in the beginning and 291.5MB in the end (delta: 144.7MB). Free memory was 50.9MB in the beginning and 238.0MB in the end (delta: -187.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23694.77ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 744.5MB). Free memory was 238.0MB in the beginning and 477.6MB in the end (delta: -239.7MB). Peak memory consumption was 503.8MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 1.0GB. Free memory is still 477.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed long int var_1_2 = -500; [L24] signed char var_1_3 = 1; [L25] signed char var_1_4 = 100; [L26] signed char var_1_5 = 5; [L27] signed char var_1_6 = 32; [L28] signed char var_1_7 = 32; [L29] unsigned short int var_1_8 = 8; [L30] unsigned short int var_1_9 = 25; [L31] unsigned short int var_1_10 = 21451; [L32] unsigned short int var_1_11 = 16; [L33] unsigned char var_1_12 = 8; [L34] unsigned short int var_1_13 = 16; [L35] unsigned char var_1_14 = 1; [L36] signed long int var_1_15 = 0; [L37] unsigned short int var_1_16 = 53444; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] double var_1_19 = 1.2; [L41] signed char var_1_20 = 1; [L42] double var_1_21 = 10.5; [L43] double var_1_22 = 0.0; [L44] double var_1_23 = 10.4; [L45] double var_1_24 = 50.5; [L46] unsigned short int var_1_25 = 2; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L92] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L94] var_1_5 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L95] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L97] var_1_6 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L98] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L99] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L99] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=32, var_1_8=8, var_1_9=25] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L102] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L102] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=25] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=-32769, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L110] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L111] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L114] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L115] var_1_15 = __VERIFIER_nondet_long() [L116] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L117] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L120] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L120] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L121] var_1_18 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L122] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L123] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L124] var_1_20 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L126] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L127] var_1_21 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L128] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L129] var_1_22 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L130] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L131] var_1_23 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L132] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L133] var_1_24 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L134] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, stepLocal_0=-1000000, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L51] COND TRUE var_1_2 >= stepLocal_0 [L52] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=0] [L56] var_1_8 = (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11)) [L57] signed long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=32891, var_1_10=-32769, var_1_11=65537, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L58] COND TRUE var_1_8 == stepLocal_1 [L59] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L61] signed long int stepLocal_2 = var_1_15; VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L62] COND FALSE !(\read(var_1_14)) [L69] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L71] COND TRUE ((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12) [L72] var_1_17 = var_1_18 VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L74] signed long int stepLocal_3 = var_1_5 - var_1_20; VAL [isInitial=1, stepLocal_2=-2147483648, stepLocal_3=0, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L75] COND TRUE var_1_1 >= stepLocal_3 [L76] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L78] COND TRUE (var_1_13 < var_1_12) || var_1_14 [L79] var_1_25 = (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139] EXPR var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L139-L140] return (((((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((var_1_13 < var_1_12) || var_1_14) ? (var_1_25 == ((unsigned short int) (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-32769, var_1_11=65537, var_1_12=62, var_1_13=0, var_1_14=0, var_1_15=-2147483648, var_1_16=98303, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=63, var_1_2=32891, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=62, var_1_8=32891, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 2033 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 581 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 1362 NumberOfCodeBlocks, 1362 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 12556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 9920/9920 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-10-24 05:29:27,106 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:29:29,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:29:29,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:29:29,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:29:29,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:29:29,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:29:29,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:29:29,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:29:29,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:29:29,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:29:29,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:29:29,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:29:29,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:29:29,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:29:29,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:29:29,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:29:29,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:29:29,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:29:29,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:29:29,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:29:29,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:29:29,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:29:29,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:29:29,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:29:29,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:29:29,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:29:29,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:29:29,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:29:29,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:29:29,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:29:29,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:29:29,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:29:29,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:29:29,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:29:29,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:29:29,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:29:29,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:29:29,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:29:29,339 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:29:29,339 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-10-24 05:29:29,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:29:29,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:29:29,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:29:29,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:29:29,660 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:29:29,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-24 05:29:31,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:29:31,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:29:31,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-10-24 05:29:31,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9465f2f1d/39304cf0dbb840b48a1256479e52e329/FLAG40d71cfc5 [2024-10-24 05:29:31,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9465f2f1d/39304cf0dbb840b48a1256479e52e329 [2024-10-24 05:29:31,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:29:31,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:29:31,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:29:31,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:29:31,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:29:31,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f3d611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31, skipping insertion in model container [2024-10-24 05:29:31,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:29:31,733 WARN L248 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_codestructure_steplocals_file-21.i[917,930] [2024-10-24 05:29:31,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:29:31,816 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:29:31,835 WARN L248 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_codestructure_steplocals_file-21.i[917,930] [2024-10-24 05:29:31,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:29:31,891 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:29:31,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31 WrapperNode [2024-10-24 05:29:31,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:29:31,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:29:31,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:29:31,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:29:31,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,943 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-24 05:29:31,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:29:31,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:29:31,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:29:31,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:29:31,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,982 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-10-24 05:29:31,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:31,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:32,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:32,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:32,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:29:32,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:29:32,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:29:32,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:29:32,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (1/1) ... [2024-10-24 05:29:32,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:29:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:29:32,043 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-10-24 05:29:32,047 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-10-24 05:29:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:29:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:29:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:29:32,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:29:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:29:32,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:29:32,192 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:29:32,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:29:33,101 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 05:29:33,101 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:29:33,138 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:29:33,140 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:29:33,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:29:33 BoogieIcfgContainer [2024-10-24 05:29:33,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:29:33,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:29:33,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:29:33,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:29:33,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:29:31" (1/3) ... [2024-10-24 05:29:33,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f4cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:29:33, skipping insertion in model container [2024-10-24 05:29:33,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:29:31" (2/3) ... [2024-10-24 05:29:33,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f4cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:29:33, skipping insertion in model container [2024-10-24 05:29:33,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:29:33" (3/3) ... [2024-10-24 05:29:33,148 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-10-24 05:29:33,160 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:29:33,161 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:29:33,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:29:33,224 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;@58b564c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:29:33,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:29:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:33,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 05:29:33,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:33,242 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:33,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:33,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash -694731706, now seen corresponding path program 1 times [2024-10-24 05:29:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:29:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775784204] [2024-10-24 05:29:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:33,261 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-10-24 05:29:33,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:29:33,264 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-10-24 05:29:33,265 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-10-24 05:29:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:33,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:29:33,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:29:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-10-24 05:29:33,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:29:33,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:29:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775784204] [2024-10-24 05:29:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775784204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:29:33,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:29:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:29:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461762913] [2024-10-24 05:29:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:29:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:29:33,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:29:33,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:29:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:29:33,704 INFO L87 Difference]: Start difference. First operand has 73 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 05:29:34,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:29:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:29:34,796 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2024-10-24 05:29:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:29:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 192 [2024-10-24 05:29:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:29:34,826 INFO L225 Difference]: With dead ends: 143 [2024-10-24 05:29:34,827 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 05:29:34,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-10-24 05:29:34,834 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:29:34,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 05:29:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 05:29:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 05:29:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 05:29:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-24 05:29:34,885 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 192 [2024-10-24 05:29:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:29:34,886 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-24 05:29:34,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 05:29:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-24 05:29:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 05:29:34,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:29:34,890 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:29:34,902 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-10-24 05:29:35,091 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-10-24 05:29:35,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:29:35,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:29:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash 273415230, now seen corresponding path program 1 times [2024-10-24 05:29:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:29:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237517479] [2024-10-24 05:29:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:29:35,094 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-10-24 05:29:35,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:29:35,097 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-10-24 05:29:35,098 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-10-24 05:29:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:29:38,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-24 05:29:38,089 INFO L278 TraceCheckSpWp]: Computing forward predicates...