./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.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 ecc9548c34ff55a16ac48b58bea78ad54785734ed6f419d0b0619af77c327fdc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:17:48,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:17:48,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:17:48,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:17:48,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:17:48,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:17:48,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:17:48,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:17:48,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:17:48,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:17:48,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:17:48,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:17:48,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:17:48,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:17:48,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:17:48,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:17:48,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:17:48,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:17:48,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:17:48,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:17:48,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:17:48,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:17:48,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:17:48,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:17:48,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:17:48,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:17:48,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:17:48,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:17:48,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:17:48,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:17:48,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:17:48,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:17:48,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:17:48,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:17:48,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:17:48,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:17:48,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:17:48,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:17:48,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:17:48,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:17:48,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:17:48,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:17:48,313 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 -> ecc9548c34ff55a16ac48b58bea78ad54785734ed6f419d0b0619af77c327fdc [2024-11-16 15:17:48,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:17:48,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:17:48,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:17:48,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:17:48,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:17:48,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i [2024-11-16 15:17:49,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:17:50,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:17:50,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i [2024-11-16 15:17:50,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43c72092/8c25f8689f0b4f4e80371505765e07ce/FLAGe60cf81a8 [2024-11-16 15:17:50,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43c72092/8c25f8689f0b4f4e80371505765e07ce [2024-11-16 15:17:50,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:17:50,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:17:50,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:17:50,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:17:50,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:17:50,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7085e3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50, skipping insertion in model container [2024-11-16 15:17:50,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:17:50,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i[919,932] [2024-11-16 15:17:50,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:17:50,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:17:50,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i[919,932] [2024-11-16 15:17:50,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:17:50,584 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:17:50,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50 WrapperNode [2024-11-16 15:17:50,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:17:50,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:17:50,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:17:50,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:17:50,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,688 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-16 15:17:50,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:17:50,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:17:50,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:17:50,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:17:50,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,737 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:17:50,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:17:50,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:17:50,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:17:50,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:17:50,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (1/1) ... [2024-11-16 15:17:50,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:17:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:17:50,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:17:50,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:17:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:17:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:17:50,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:17:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:17:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:17:50,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:17:50,946 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:17:50,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:17:51,305 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 15:17:51,305 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:17:51,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:17:51,324 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 15:17:51,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:17:51 BoogieIcfgContainer [2024-11-16 15:17:51,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:17:51,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:17:51,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:17:51,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:17:51,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:17:50" (1/3) ... [2024-11-16 15:17:51,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6e3c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:17:51, skipping insertion in model container [2024-11-16 15:17:51,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:17:50" (2/3) ... [2024-11-16 15:17:51,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6e3c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:17:51, skipping insertion in model container [2024-11-16 15:17:51,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:17:51" (3/3) ... [2024-11-16 15:17:51,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i [2024-11-16 15:17:51,342 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:17:51,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:17:51,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:17:51,389 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;@3e14a1dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:17:51,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:17:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 72 states have (on average 1.375) internal successors, (99), 73 states have internal predecessors, (99), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:17:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-16 15:17:51,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:51,405 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:51,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1191290694, now seen corresponding path program 1 times [2024-11-16 15:17:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:51,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331904185] [2024-11-16 15:17:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331904185] [2024-11-16 15:17:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331904185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:51,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:17:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954727452] [2024-11-16 15:17:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:51,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:17:51,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:17:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:17:51,812 INFO L87 Difference]: Start difference. First operand has 110 states, 72 states have (on average 1.375) internal successors, (99), 73 states have internal predecessors, (99), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-16 15:17:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:51,840 INFO L93 Difference]: Finished difference Result 211 states and 365 transitions. [2024-11-16 15:17:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:17:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 227 [2024-11-16 15:17:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:51,848 INFO L225 Difference]: With dead ends: 211 [2024-11-16 15:17:51,849 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 15:17:51,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:17:51,854 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:51,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:17:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 15:17:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-16 15:17:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:17:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-11-16 15:17:51,892 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 227 [2024-11-16 15:17:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:51,892 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-11-16 15:17:51,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-16 15:17:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-11-16 15:17:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-16 15:17:51,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:51,896 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:51,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:17:51,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:51,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -476256191, now seen corresponding path program 1 times [2024-11-16 15:17:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:51,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750919230] [2024-11-16 15:17:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:52,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750919230] [2024-11-16 15:17:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750919230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:52,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:17:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490986754] [2024-11-16 15:17:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:52,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:17:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:17:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:17:52,155 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:52,191 INFO L93 Difference]: Finished difference Result 206 states and 315 transitions. [2024-11-16 15:17:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:17:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2024-11-16 15:17:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:52,195 INFO L225 Difference]: With dead ends: 206 [2024-11-16 15:17:52,195 INFO L226 Difference]: Without dead ends: 105 [2024-11-16 15:17:52,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:17:52,197 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:52,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:17:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-16 15:17:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-16 15:17:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:17:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2024-11-16 15:17:52,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 159 transitions. Word has length 227 [2024-11-16 15:17:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:52,213 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 159 transitions. [2024-11-16 15:17:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 159 transitions. [2024-11-16 15:17:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-16 15:17:52,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:52,216 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:52,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:17:52,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:52,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1649083164, now seen corresponding path program 1 times [2024-11-16 15:17:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513920696] [2024-11-16 15:17:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513920696] [2024-11-16 15:17:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513920696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:17:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559715570] [2024-11-16 15:17:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:52,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:17:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:17:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:17:52,569 INFO L87 Difference]: Start difference. First operand 105 states and 159 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:52,619 INFO L93 Difference]: Finished difference Result 207 states and 315 transitions. [2024-11-16 15:17:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:17:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-16 15:17:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:52,624 INFO L225 Difference]: With dead ends: 207 [2024-11-16 15:17:52,624 INFO L226 Difference]: Without dead ends: 105 [2024-11-16 15:17:52,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:17:52,626 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:52,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:17:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-16 15:17:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-16 15:17:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:17:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-16 15:17:52,638 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 228 [2024-11-16 15:17:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:52,639 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-16 15:17:52,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-16 15:17:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-16 15:17:52,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:52,642 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:52,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:17:52,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:52,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2135349955, now seen corresponding path program 1 times [2024-11-16 15:17:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:52,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283043024] [2024-11-16 15:17:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283043024] [2024-11-16 15:17:52,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283043024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:52,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:52,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:17:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663139995] [2024-11-16 15:17:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:52,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:17:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:17:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:17:52,825 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:52,869 INFO L93 Difference]: Finished difference Result 228 states and 346 transitions. [2024-11-16 15:17:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:17:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-16 15:17:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:52,871 INFO L225 Difference]: With dead ends: 228 [2024-11-16 15:17:52,872 INFO L226 Difference]: Without dead ends: 126 [2024-11-16 15:17:52,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:17:52,873 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 25 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:52,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 460 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:17:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-16 15:17:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-11-16 15:17:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:17:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2024-11-16 15:17:52,883 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 228 [2024-11-16 15:17:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:52,883 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2024-11-16 15:17:52,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2024-11-16 15:17:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-16 15:17:52,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:52,886 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:17:52,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2128597534, now seen corresponding path program 1 times [2024-11-16 15:17:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976415540] [2024-11-16 15:17:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976415540] [2024-11-16 15:17:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976415540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:53,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:53,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:17:53,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234963107] [2024-11-16 15:17:53,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:53,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:17:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:17:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:17:53,098 INFO L87 Difference]: Start difference. First operand 118 states and 178 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:53,304 INFO L93 Difference]: Finished difference Result 347 states and 526 transitions. [2024-11-16 15:17:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:17:53,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-16 15:17:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:53,309 INFO L225 Difference]: With dead ends: 347 [2024-11-16 15:17:53,309 INFO L226 Difference]: Without dead ends: 232 [2024-11-16 15:17:53,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:17:53,313 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 150 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:53,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 352 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:17:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-16 15:17:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2024-11-16 15:17:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:17:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 183 transitions. [2024-11-16 15:17:53,339 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 183 transitions. Word has length 228 [2024-11-16 15:17:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:53,340 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 183 transitions. [2024-11-16 15:17:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 183 transitions. [2024-11-16 15:17:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-16 15:17:53,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:53,343 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:53,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:17:53,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:53,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash -385787199, now seen corresponding path program 1 times [2024-11-16 15:17:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830102043] [2024-11-16 15:17:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830102043] [2024-11-16 15:17:53,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830102043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:53,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:53,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:17:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312100824] [2024-11-16 15:17:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:53,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:17:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:17:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:17:53,758 INFO L87 Difference]: Start difference. First operand 122 states and 183 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:53,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:53,799 INFO L93 Difference]: Finished difference Result 343 states and 520 transitions. [2024-11-16 15:17:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:17:53,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-16 15:17:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:53,802 INFO L225 Difference]: With dead ends: 343 [2024-11-16 15:17:53,803 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 15:17:53,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:17:53,805 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 72 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:53,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 298 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:17:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 15:17:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 190. [2024-11-16 15:17:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 117 states have internal predecessors, (146), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 15:17:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 286 transitions. [2024-11-16 15:17:53,849 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 286 transitions. Word has length 228 [2024-11-16 15:17:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:53,850 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 286 transitions. [2024-11-16 15:17:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 286 transitions. [2024-11-16 15:17:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-16 15:17:53,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:53,852 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:53,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:17:53,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash -630866199, now seen corresponding path program 1 times [2024-11-16 15:17:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829397716] [2024-11-16 15:17:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 105 proven. 93 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2024-11-16 15:17:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829397716] [2024-11-16 15:17:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829397716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:17:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289096474] [2024-11-16 15:17:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:17:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:17:54,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:17:54,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:17:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:54,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 15:17:54,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:17:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1305 proven. 93 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-16 15:17:55,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:17:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 105 proven. 96 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-11-16 15:17:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289096474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:17:56,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:17:56,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2024-11-16 15:17:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856747114] [2024-11-16 15:17:56,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:17:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 15:17:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 15:17:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-16 15:17:56,132 INFO L87 Difference]: Start difference. First operand 190 states and 286 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 6 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 6 states have call predecessors, (70), 6 states have call successors, (70) [2024-11-16 15:17:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:57,576 INFO L93 Difference]: Finished difference Result 479 states and 688 transitions. [2024-11-16 15:17:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-16 15:17:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 6 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 6 states have call predecessors, (70), 6 states have call successors, (70) Word has length 230 [2024-11-16 15:17:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:57,583 INFO L225 Difference]: With dead ends: 479 [2024-11-16 15:17:57,583 INFO L226 Difference]: Without dead ends: 360 [2024-11-16 15:17:57,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 15:17:57,585 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 474 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:57,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1003 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 15:17:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-16 15:17:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 298. [2024-11-16 15:17:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 181 states have (on average 1.1933701657458564) internal successors, (216), 182 states have internal predecessors, (216), 105 states have call successors, (105), 11 states have call predecessors, (105), 11 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-16 15:17:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 426 transitions. [2024-11-16 15:17:57,679 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 426 transitions. Word has length 230 [2024-11-16 15:17:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:57,684 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 426 transitions. [2024-11-16 15:17:57,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 6 states have call successors, (69), 3 states have call predecessors, (69), 7 states have return successors, (70), 6 states have call predecessors, (70), 6 states have call successors, (70) [2024-11-16 15:17:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 426 transitions. [2024-11-16 15:17:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-16 15:17:57,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:57,687 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:57,718 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-11-16 15:17:57,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:17:57,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2050373481, now seen corresponding path program 1 times [2024-11-16 15:17:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660593515] [2024-11-16 15:17:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:17:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:17:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:17:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:17:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:17:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:17:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:17:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 15:17:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:17:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 15:17:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:17:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:17:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:17:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:17:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:17:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:17:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:17:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:17:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:17:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:17:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:17:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:17:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 15:17:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 15:17:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 15:17:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 15:17:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:17:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 15:17:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 15:17:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 15:17:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 15:17:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 15:17:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 15:17:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 15:17:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-16 15:17:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:17:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:17:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:17:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660593515] [2024-11-16 15:17:58,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660593515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:17:58,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:17:58,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:17:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839082501] [2024-11-16 15:17:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:17:58,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:17:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:17:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:17:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:17:58,062 INFO L87 Difference]: Start difference. First operand 298 states and 426 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:17:58,212 INFO L93 Difference]: Finished difference Result 513 states and 737 transitions. [2024-11-16 15:17:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:17:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 230 [2024-11-16 15:17:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:17:58,216 INFO L225 Difference]: With dead ends: 513 [2024-11-16 15:17:58,216 INFO L226 Difference]: Without dead ends: 298 [2024-11-16 15:17:58,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:17:58,218 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 150 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:17:58,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 213 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:17:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-16 15:17:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2024-11-16 15:17:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 178 states have internal predecessors, (209), 105 states have call successors, (105), 11 states have call predecessors, (105), 11 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-16 15:17:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 419 transitions. [2024-11-16 15:17:58,274 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 419 transitions. Word has length 230 [2024-11-16 15:17:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:17:58,274 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 419 transitions. [2024-11-16 15:17:58,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:17:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 419 transitions. [2024-11-16 15:17:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-16 15:17:58,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:17:58,277 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:58,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:17:58,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:17:58,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:17:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash -501783480, now seen corresponding path program 1 times [2024-11-16 15:17:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:17:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977230116] [2024-11-16 15:17:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:17:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:17:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146445593] [2024-11-16 15:17:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:17:58,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:17:58,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:17:58,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:17:58,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 15:17:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:17:58,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:17:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:17:58,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:17:58,692 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:17:58,692 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:17:58,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 15:17:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 15:17:58,900 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:17:59,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:17:59,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:17:59 BoogieIcfgContainer [2024-11-16 15:17:59,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:17:59,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:17:59,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:17:59,014 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:17:59,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:17:51" (3/4) ... [2024-11-16 15:17:59,016 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:17:59,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:17:59,017 INFO L158 Benchmark]: Toolchain (without parser) took 8888.52ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 93.4MB in the beginning and 205.2MB in the end (delta: -111.8MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,017 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:17:59,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.42ms. Allocated memory is still 161.5MB. Free memory was 93.2MB in the beginning and 127.8MB in the end (delta: -34.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.23ms. Allocated memory is still 161.5MB. Free memory was 127.8MB in the beginning and 123.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,018 INFO L158 Benchmark]: Boogie Preprocessor took 89.40ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 115.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,018 INFO L158 Benchmark]: IcfgBuilder took 545.88ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 84.6MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,019 INFO L158 Benchmark]: TraceAbstraction took 7687.41ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 84.4MB in the beginning and 206.2MB in the end (delta: -121.8MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,019 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 343.9MB. Free memory was 206.2MB in the beginning and 205.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:17:59,020 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.11ms. Allocated memory is still 161.5MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.42ms. Allocated memory is still 161.5MB. Free memory was 93.2MB in the beginning and 127.8MB in the end (delta: -34.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.23ms. Allocated memory is still 161.5MB. Free memory was 127.8MB in the beginning and 123.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.40ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 115.2MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 545.88ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 84.6MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7687.41ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 84.4MB in the beginning and 206.2MB in the end (delta: -121.8MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 343.9MB. Free memory was 206.2MB in the beginning and 205.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of bitwiseAnd at line 67, overapproximation of someUnaryDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 92, overapproximation of someUnaryFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] unsigned char var_1_32 = 200; [L44] double var_1_33 = 31.625; [L45] double var_1_35 = 7.5; [L46] double var_1_36 = 15.75; [L47] double var_1_37 = 15.375; [L48] unsigned short int var_1_38 = 16; [L49] unsigned char var_1_39 = 0; [L50] unsigned char var_1_40 = 0; [L51] unsigned char var_1_41 = 1; [L52] unsigned char var_1_42 = 1; [L53] unsigned char var_1_43 = 0; [L54] double var_1_44 = 128.5; [L55] float var_1_45 = 1.85; [L56] double var_1_46 = 1.5; [L57] double var_1_47 = 99999999999.4; [L58] unsigned char var_1_49 = 128; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=0, var_1_8=1, var_1_9=-2] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] FCALL updateLastVariables() [L200] CALL updateVariables() [L132] var_1_7 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] var_1_8 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_14 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] var_1_15 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] var_1_16 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] var_1_18 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] var_1_21 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_24 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_26 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] var_1_27 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_32 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L165] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L165] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=15/2, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L166] var_1_35 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L167] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L168] var_1_36 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L169] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L170] var_1_37 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L171] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L172] var_1_40 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L173] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L174] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L174] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L175] var_1_41 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L176] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L178] var_1_42 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_42 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L179] RET assume_abort_if_not(var_1_42 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L180] CALL assume_abort_if_not(var_1_42 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L180] RET assume_abort_if_not(var_1_42 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L181] var_1_43 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L182] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L183] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L183] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L184] var_1_46 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L185] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L186] var_1_47 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L187] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L200] RET updateVariables() [L201] CALL step() [L62] var_1_31 = var_1_32 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L63] COND FALSE !(! var_1_30) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L66] var_1_38 = ((((var_1_17) > (var_1_32)) ? (var_1_17) : (var_1_32))) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L67] EXPR var_1_17 & (var_1_17 + 2u) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L67] EXPR 16u >> var_1_32 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L67] COND TRUE (var_1_17 & (var_1_17 + 2u)) < (16u >> var_1_32) [L68] var_1_39 = ((var_1_40 && (var_1_41 && var_1_42)) && (! var_1_43)) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L70] COND FALSE !(var_1_36 <= var_1_35) [L75] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_36=2, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L77] COND FALSE !((var_1_13 * (var_1_46 - var_1_47)) < var_1_35) [L82] var_1_45 = (((((((((((var_1_35) > (var_1_36)) ? (var_1_35) : (var_1_36)))) < (var_1_37)) ? (((((var_1_35) > (var_1_36)) ? (var_1_35) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_35) > (var_1_36)) ? (var_1_35) : (var_1_36)))) < (var_1_37)) ? (((((var_1_35) > (var_1_36)) ? (var_1_35) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_35) > (var_1_36)) ? (var_1_35) : (var_1_36)))) < (var_1_37)) ? (((((var_1_35) > (var_1_36)) ? (var_1_35) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L84] var_1_30 || (var_1_32 >= (var_1_9 & var_1_9)) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L84] COND TRUE var_1_30 || (var_1_32 >= (var_1_9 & var_1_9)) [L85] COND FALSE !(-2 > var_1_9) [L88] var_1_49 = var_1_32 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] COND TRUE \read(var_1_8) [L92] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L94] COND TRUE \read(var_1_8) [L95] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L97] var_1_29 = var_1_27 [L98] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L99] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L102] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L104] var_1_17 = ((var_1_18 - 25) - var_1_25) [L105] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L106] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L107] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L111] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L112] COND FALSE !((~ var_1_29) > stepLocal_3) [L115] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L117] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L118] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L119] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L128] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_13=4, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16382, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=253/8, var_1_35=0, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=1, var_1_42=1, var_1_43=0, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 954 mSDsluCounter, 2931 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1675 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1259 IncrementalHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 1256 mSDtfsCounter, 1259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1121 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 218 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2276 ConstructedInterpolants, 0 QuantifiedInterpolants, 5985 SizeOfPredicates, 5 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 23518/23800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:17:59,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.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 ecc9548c34ff55a16ac48b58bea78ad54785734ed6f419d0b0619af77c327fdc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:18:01,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:18:01,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:18:01,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:18:01,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:18:01,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:18:01,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:18:01,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:18:01,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:18:01,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:18:01,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:18:01,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:18:01,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:18:01,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:18:01,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:18:01,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:18:01,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:18:01,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:18:01,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:18:01,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:18:01,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:18:01,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:18:01,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:18:01,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:18:01,142 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:18:01,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:18:01,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:18:01,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:18:01,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:18:01,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:18:01,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:18:01,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:18:01,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:18:01,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:18:01,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:18:01,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:18:01,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:18:01,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:18:01,144 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:18:01,144 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:18:01,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:18:01,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:18:01,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:18:01,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:18:01,148 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 -> ecc9548c34ff55a16ac48b58bea78ad54785734ed6f419d0b0619af77c327fdc [2024-11-16 15:18:01,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:18:01,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:18:01,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:18:01,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:18:01,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:18:01,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i [2024-11-16 15:18:02,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:18:02,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:18:03,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i [2024-11-16 15:18:03,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b6ee927/d1d627259f9c4afab98806a9db18b230/FLAG720d747b6 [2024-11-16 15:18:03,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b6ee927/d1d627259f9c4afab98806a9db18b230 [2024-11-16 15:18:03,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:18:03,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:18:03,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:18:03,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:18:03,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:18:03,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb84d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03, skipping insertion in model container [2024-11-16 15:18:03,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:18:03,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i[919,932] [2024-11-16 15:18:03,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:18:03,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:18:03,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i[919,932] [2024-11-16 15:18:03,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:18:03,403 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:18:03,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03 WrapperNode [2024-11-16 15:18:03,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:18:03,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:18:03,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:18:03,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:18:03,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,465 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-16 15:18:03,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:18:03,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:18:03,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:18:03,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:18:03,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:18:03,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:18:03,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:18:03,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:18:03,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:18:03,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (1/1) ... [2024-11-16 15:18:03,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:18:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:18:03,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:18:03,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:18:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:18:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:18:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:18:03,679 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:18:03,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:18:13,909 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 15:18:13,912 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:18:13,926 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:18:13,926 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:18:13,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:18:13 BoogieIcfgContainer [2024-11-16 15:18:13,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:18:13,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:18:13,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:18:13,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:18:13,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:18:03" (1/3) ... [2024-11-16 15:18:13,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f751091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:18:13, skipping insertion in model container [2024-11-16 15:18:13,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:18:03" (2/3) ... [2024-11-16 15:18:13,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f751091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:18:13, skipping insertion in model container [2024-11-16 15:18:13,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:18:13" (3/3) ... [2024-11-16 15:18:13,933 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-50.i [2024-11-16 15:18:13,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:18:13,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:18:13,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:18:14,003 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;@12a1aece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:18:14,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:18:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 62 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:18:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-16 15:18:14,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:18:14,024 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:18:14,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:18:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:18:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1697465550, now seen corresponding path program 1 times [2024-11-16 15:18:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:18:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793840851] [2024-11-16 15:18:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:18:14,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:14,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:18:14,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:18:14,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:18:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:18:14,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:18:14,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:18:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2024-11-16 15:18:14,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:18:14,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:18:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793840851] [2024-11-16 15:18:14,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793840851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:18:14,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:18:14,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:18:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504420021] [2024-11-16 15:18:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:18:14,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:18:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:18:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:18:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:18:14,699 INFO L87 Difference]: Start difference. First operand has 99 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 62 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:18:14,736 INFO L93 Difference]: Finished difference Result 190 states and 332 transitions. [2024-11-16 15:18:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:18:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-16 15:18:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:18:14,745 INFO L225 Difference]: With dead ends: 190 [2024-11-16 15:18:14,745 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 15:18:14,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:18:14,754 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:18:14,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:18:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 15:18:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 15:18:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 15:18:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2024-11-16 15:18:14,803 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 223 [2024-11-16 15:18:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:18:14,804 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2024-11-16 15:18:14,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2024-11-16 15:18:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-16 15:18:14,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:18:14,807 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:18:14,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 15:18:15,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:15,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:18:15,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:18:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1209446357, now seen corresponding path program 1 times [2024-11-16 15:18:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:18:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342471274] [2024-11-16 15:18:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:18:15,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:15,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:18:15,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:18:15,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:18:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:18:15,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 15:18:15,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:18:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:18:17,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:18:17,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:18:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342471274] [2024-11-16 15:18:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342471274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:18:17,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:18:17,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:18:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603101512] [2024-11-16 15:18:17,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:18:17,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:18:17,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:18:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:18:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:18:17,821 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:18:18,117 INFO L93 Difference]: Finished difference Result 260 states and 404 transitions. [2024-11-16 15:18:18,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:18:18,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-16 15:18:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:18:18,121 INFO L225 Difference]: With dead ends: 260 [2024-11-16 15:18:18,121 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 15:18:18,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:18:18,123 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:18:18,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:18:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 15:18:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-11-16 15:18:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 15:18:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2024-11-16 15:18:18,155 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 223 [2024-11-16 15:18:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:18:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2024-11-16 15:18:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2024-11-16 15:18:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 15:18:18,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:18:18,158 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:18:18,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:18:18,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:18,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:18:18,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:18:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1324999279, now seen corresponding path program 1 times [2024-11-16 15:18:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:18:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92717076] [2024-11-16 15:18:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:18:18,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:18,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:18:18,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:18:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 15:18:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:18:18,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 15:18:18,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:18:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:18:21,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:18:21,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:18:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92717076] [2024-11-16 15:18:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92717076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:18:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:18:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:18:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608069735] [2024-11-16 15:18:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:18:21,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:18:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:18:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:18:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:18:21,018 INFO L87 Difference]: Start difference. First operand 165 states and 254 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:18:21,235 INFO L93 Difference]: Finished difference Result 267 states and 414 transitions. [2024-11-16 15:18:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:18:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-16 15:18:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:18:21,242 INFO L225 Difference]: With dead ends: 267 [2024-11-16 15:18:21,243 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 15:18:21,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:18:21,244 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:18:21,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 278 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:18:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 15:18:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2024-11-16 15:18:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 92 states have internal predecessors, (113), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 15:18:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 253 transitions. [2024-11-16 15:18:21,279 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 253 transitions. Word has length 224 [2024-11-16 15:18:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:18:21,281 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 253 transitions. [2024-11-16 15:18:21,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 253 transitions. [2024-11-16 15:18:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 15:18:21,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:18:21,286 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:18:21,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 15:18:21,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:21,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:18:21,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:18:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash 916175054, now seen corresponding path program 1 times [2024-11-16 15:18:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:18:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749383096] [2024-11-16 15:18:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:18:21,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:18:21,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:18:21,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 15:18:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:18:21,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 15:18:21,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:18:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:18:23,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:18:23,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:18:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749383096] [2024-11-16 15:18:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749383096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:18:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:18:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:18:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148788244] [2024-11-16 15:18:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:18:23,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:18:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:18:23,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:18:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:18:23,876 INFO L87 Difference]: Start difference. First operand 165 states and 253 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:18:24,590 INFO L93 Difference]: Finished difference Result 261 states and 403 transitions. [2024-11-16 15:18:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:18:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-16 15:18:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:18:24,593 INFO L225 Difference]: With dead ends: 261 [2024-11-16 15:18:24,599 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 15:18:24,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:18:24,600 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 15:18:24,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 270 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 15:18:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 15:18:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-11-16 15:18:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 15:18:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 254 transitions. [2024-11-16 15:18:24,645 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 254 transitions. Word has length 224 [2024-11-16 15:18:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:18:24,645 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 254 transitions. [2024-11-16 15:18:24,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 254 transitions. [2024-11-16 15:18:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 15:18:24,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:18:24,647 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:18:24,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 15:18:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:24,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:18:24,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:18:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 405640877, now seen corresponding path program 1 times [2024-11-16 15:18:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:18:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938496288] [2024-11-16 15:18:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:18:24,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:18:24,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:18:24,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 15:18:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:18:25,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 15:18:25,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:18:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-16 15:18:25,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:18:25,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:18:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938496288] [2024-11-16 15:18:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938496288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:18:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:18:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:18:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077287926] [2024-11-16 15:18:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:18:25,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:18:25,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:18:25,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:18:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:18:25,444 INFO L87 Difference]: Start difference. First operand 166 states and 254 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:26,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 15:18:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:18:27,473 INFO L93 Difference]: Finished difference Result 261 states and 402 transitions. [2024-11-16 15:18:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:18:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-16 15:18:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:18:27,476 INFO L225 Difference]: With dead ends: 261 [2024-11-16 15:18:27,476 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 15:18:27,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:18:27,478 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 135 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:18:27,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 611 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 15:18:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 15:18:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2024-11-16 15:18:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 92 states have internal predecessors, (111), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 15:18:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2024-11-16 15:18:27,530 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 224 [2024-11-16 15:18:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:18:27,531 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2024-11-16 15:18:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-16 15:18:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2024-11-16 15:18:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 15:18:27,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:18:27,533 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:18:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 15:18:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:27,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:18:27,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:18:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2146516084, now seen corresponding path program 1 times [2024-11-16 15:18:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:18:27,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54941450] [2024-11-16 15:18:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:18:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:18:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:18:27,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:18:27,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 15:18:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:18:28,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 15:18:28,222 INFO L278 TraceCheckSpWp]: Computing forward predicates...