./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:17:24,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:17:24,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:17:24,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:17:24,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:17:24,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:17:24,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:17:24,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:17:24,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:17:24,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:17:24,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:17:24,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:17:24,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:17:24,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:17:24,511 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:17:24,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:17:24,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:17:24,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:17:24,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:17:24,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:17:24,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:17:24,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:17:24,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:17:24,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:17:24,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:17:24,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:17:24,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:17:24,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:17:24,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:17:24,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:17:24,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:17:24,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:17:24,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:17:24,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:17:24,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:17:24,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:17:24,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:17:24,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:17:24,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:17:24,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:17:24,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:17:24,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:17:24,522 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-09 02:17:24,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:17:24,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:17:24,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:17:24,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:17:24,846 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:17:24,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-09 02:17:26,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:17:26,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:17:26,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-09 02:17:26,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da184609d/e7a794510cee4c429e5d6533bae02dbc/FLAGff639785e [2024-11-09 02:17:26,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da184609d/e7a794510cee4c429e5d6533bae02dbc [2024-11-09 02:17:26,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:17:26,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:17:26,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:17:26,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:17:26,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:17:26,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677cf8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26, skipping insertion in model container [2024-11-09 02:17:26,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:17:26,738 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-11-09 02:17:26,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:17:26,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:17:26,824 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-11-09 02:17:26,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:17:26,887 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:17:26,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26 WrapperNode [2024-11-09 02:17:26,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:17:26,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:17:26,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:17:26,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:17:26,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,952 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-11-09 02:17:26,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:17:26,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:17:26,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:17:26,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:17:26,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,978 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:17:26,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:26,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:27,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:27,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:27,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:17:27,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:17:27,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:17:27,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:17:27,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (1/1) ... [2024-11-09 02:17:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:17:27,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:17:27,060 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-09 02:17:27,066 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-09 02:17:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:17:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:17:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:17:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:17:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:17:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:17:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:17:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:17:27,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:17:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:17:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:17:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:17:27,308 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:17:27,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:17:27,873 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 02:17:27,873 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:17:27,892 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:17:27,892 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:17:27,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:27 BoogieIcfgContainer [2024-11-09 02:17:27,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:17:27,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:17:27,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:17:27,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:17:27,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:17:26" (1/3) ... [2024-11-09 02:17:27,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249636ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:17:27, skipping insertion in model container [2024-11-09 02:17:27,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:26" (2/3) ... [2024-11-09 02:17:27,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249636ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:17:27, skipping insertion in model container [2024-11-09 02:17:27,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:27" (3/3) ... [2024-11-09 02:17:27,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-09 02:17:27,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:17:27,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:17:27,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:17:27,990 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;@1de1464, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:17:27,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:17:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:28,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:28,011 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:28,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:28,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1431925537, now seen corresponding path program 1 times [2024-11-09 02:17:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024020744] [2024-11-09 02:17:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024020744] [2024-11-09 02:17:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024020744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:28,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:28,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:17:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117012608] [2024-11-09 02:17:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:17:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:17:28,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:17:28,625 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:17:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:28,663 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-09 02:17:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:17:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 02:17:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:28,675 INFO L225 Difference]: With dead ends: 193 [2024-11-09 02:17:28,676 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 02:17:28,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-09 02:17:28,713 INFO L432 NwaCegarLoop]: 138 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, 138 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-09 02:17:28,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 02:17:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 02:17:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-09 02:17:28,776 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-09 02:17:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:28,777 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-09 02:17:28,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:17:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-09 02:17:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:28,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:28,781 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:28,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:17:28,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:28,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2107248781, now seen corresponding path program 1 times [2024-11-09 02:17:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498083756] [2024-11-09 02:17:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:29,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498083756] [2024-11-09 02:17:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498083756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:29,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035637628] [2024-11-09 02:17:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:29,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:29,198 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:17:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:29,252 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-09 02:17:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:29,255 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), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-09 02:17:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:29,258 INFO L225 Difference]: With dead ends: 191 [2024-11-09 02:17:29,258 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 02:17:29,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:29,260 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:29,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 02:17:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 02:17:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 02:17:29,275 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-09 02:17:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:29,281 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 02:17:29,281 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), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:17:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 02:17:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:29,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:29,283 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:29,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:17:29,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:29,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 568908751, now seen corresponding path program 1 times [2024-11-09 02:17:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107862700] [2024-11-09 02:17:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107862700] [2024-11-09 02:17:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107862700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797158474] [2024-11-09 02:17:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:29,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:29,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:29,550 INFO L87 Difference]: Start difference. First operand 98 states and 140 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:29,579 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-09 02:17:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:29,579 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:17:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:29,581 INFO L225 Difference]: With dead ends: 196 [2024-11-09 02:17:29,581 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 02:17:29,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:29,583 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:29,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 02:17:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-09 02:17:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-09 02:17:29,592 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-09 02:17:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-09 02:17:29,593 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-09 02:17:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:29,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:29,595 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:17:29,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:29,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1248967121, now seen corresponding path program 1 times [2024-11-09 02:17:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923355934] [2024-11-09 02:17:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923355934] [2024-11-09 02:17:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923355934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936762021] [2024-11-09 02:17:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:29,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:29,844 INFO L87 Difference]: Start difference. First operand 100 states and 142 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:29,879 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-09 02:17:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:29,880 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:17:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:29,882 INFO L225 Difference]: With dead ends: 200 [2024-11-09 02:17:29,882 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 02:17:29,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:29,883 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:29,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 02:17:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-09 02:17:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-09 02:17:29,891 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-09 02:17:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-09 02:17:29,892 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-09 02:17:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:29,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:29,894 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:29,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:17:29,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1270992813, now seen corresponding path program 1 times [2024-11-09 02:17:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609869345] [2024-11-09 02:17:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:30,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609869345] [2024-11-09 02:17:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609869345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:30,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:17:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666655267] [2024-11-09 02:17:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:30,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:17:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:17:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:17:30,890 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:31,158 INFO L93 Difference]: Finished difference Result 203 states and 287 transitions. [2024-11-09 02:17:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:17:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:17:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:31,166 INFO L225 Difference]: With dead ends: 203 [2024-11-09 02:17:31,166 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 02:17:31,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:17:31,168 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 96 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:31,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 304 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:17:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 02:17:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-09 02:17:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-09 02:17:31,187 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2024-11-09 02:17:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:31,190 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-09 02:17:31,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-09 02:17:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:31,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:31,193 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:31,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:17:31,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:31,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1335030741, now seen corresponding path program 1 times [2024-11-09 02:17:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808721289] [2024-11-09 02:17:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808721289] [2024-11-09 02:17:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808721289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:32,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:17:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447218088] [2024-11-09 02:17:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:32,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:17:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:17:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:17:32,108 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:32,321 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2024-11-09 02:17:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:17:32,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:17:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:32,323 INFO L225 Difference]: With dead ends: 237 [2024-11-09 02:17:32,323 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 02:17:32,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:17:32,325 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 147 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:32,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 478 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:17:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 02:17:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-11-09 02:17:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-09 02:17:32,336 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 123 [2024-11-09 02:17:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:32,337 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-09 02:17:32,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-09 02:17:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:32,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:32,339 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:32,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:17:32,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:32,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash 375638192, now seen corresponding path program 1 times [2024-11-09 02:17:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:32,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807214067] [2024-11-09 02:17:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807214067] [2024-11-09 02:17:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807214067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:34,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:34,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:17:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592280982] [2024-11-09 02:17:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:17:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:17:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:17:34,997 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:17:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:36,705 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2024-11-09 02:17:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:17:36,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-09 02:17:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:36,707 INFO L225 Difference]: With dead ends: 241 [2024-11-09 02:17:36,708 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 02:17:36,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:17:36,709 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 264 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:36,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 584 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:17:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 02:17:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-11-09 02:17:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-09 02:17:36,732 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 125 [2024-11-09 02:17:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:36,733 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-09 02:17:36,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:17:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-09 02:17:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:36,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:36,735 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:17:36,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665936, now seen corresponding path program 1 times [2024-11-09 02:17:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688119808] [2024-11-09 02:17:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:39,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:39,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688119808] [2024-11-09 02:17:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688119808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:17:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383308869] [2024-11-09 02:17:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:17:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:39,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:17:39,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:17:39,117 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:17:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:40,450 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2024-11-09 02:17:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:17:40,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-09 02:17:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:40,453 INFO L225 Difference]: With dead ends: 237 [2024-11-09 02:17:40,454 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 02:17:40,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:17:40,455 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 328 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:40,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 391 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:17:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 02:17:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2024-11-09 02:17:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-09 02:17:40,479 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 125 [2024-11-09 02:17:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:40,479 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-09 02:17:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:17:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-09 02:17:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:40,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:40,481 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:40,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:17:40,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1444028551, now seen corresponding path program 1 times [2024-11-09 02:17:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076067673] [2024-11-09 02:17:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 02:17:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076067673] [2024-11-09 02:17:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076067673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:43,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:43,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 02:17:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12667907] [2024-11-09 02:17:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:43,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:17:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:43,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:17:43,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:17:43,376 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:17:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:45,602 INFO L93 Difference]: Finished difference Result 268 states and 372 transitions. [2024-11-09 02:17:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 02:17:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2024-11-09 02:17:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:45,605 INFO L225 Difference]: With dead ends: 268 [2024-11-09 02:17:45,605 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 02:17:45,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 02:17:45,607 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 374 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:45,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 564 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:17:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 02:17:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2024-11-09 02:17:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 132 states have internal predecessors, (171), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:17:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2024-11-09 02:17:45,635 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 125 [2024-11-09 02:17:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:45,635 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2024-11-09 02:17:45,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:17:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2024-11-09 02:17:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:17:45,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:45,637 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:45,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:17:45,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1780572309, now seen corresponding path program 1 times [2024-11-09 02:17:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:45,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281924355] [2024-11-09 02:17:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:17:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:17:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:17:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:17:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:17:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:46,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:46,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281924355] [2024-11-09 02:17:46,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281924355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:46,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:46,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:17:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855824785] [2024-11-09 02:17:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:46,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:17:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:46,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:17:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:17:46,181 INFO L87 Difference]: Start difference. First operand 160 states and 223 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:46,392 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2024-11-09 02:17:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:17:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-09 02:17:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:46,396 INFO L225 Difference]: With dead ends: 307 [2024-11-09 02:17:46,396 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 02:17:46,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:17:46,398 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 43 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:46,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 813 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:17:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 02:17:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 165. [2024-11-09 02:17:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 137 states have internal predecessors, (177), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:17:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-11-09 02:17:46,420 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 127 [2024-11-09 02:17:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-11-09 02:17:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-11-09 02:17:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:17:46,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:46,423 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:17:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:17:46,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:46,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash -696788308, now seen corresponding path program 1 times [2024-11-09 02:17:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042392492] [2024-11-09 02:17:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:18:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:18:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042392492] [2024-11-09 02:18:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042392492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:04,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-09 02:18:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516767311] [2024-11-09 02:18:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:04,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 02:18:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:04,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 02:18:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:18:04,439 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:18:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:24,930 INFO L93 Difference]: Finished difference Result 297 states and 406 transitions. [2024-11-09 02:18:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:18:24,931 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-09 02:18:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:24,933 INFO L225 Difference]: With dead ends: 297 [2024-11-09 02:18:24,933 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 02:18:24,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-09 02:18:24,935 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 355 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:24,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 833 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 02:18:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 02:18:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2024-11-09 02:18:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 134 states have internal predecessors, (172), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:18:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2024-11-09 02:18:24,962 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 127 [2024-11-09 02:18:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:24,962 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2024-11-09 02:18:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:18:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2024-11-09 02:18:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:18:24,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:24,964 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:18:24,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:18:24,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:24,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:24,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1711105474, now seen corresponding path program 1 times [2024-11-09 02:18:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449797149] [2024-11-09 02:18:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:18:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:18:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449797149] [2024-11-09 02:18:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449797149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:26,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:26,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:18:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475427033] [2024-11-09 02:18:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:26,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:18:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:18:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:18:26,073 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:26,658 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2024-11-09 02:18:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:18:26,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-09 02:18:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:26,660 INFO L225 Difference]: With dead ends: 270 [2024-11-09 02:18:26,660 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 02:18:26,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:18:26,661 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 165 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:26,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 405 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:18:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 02:18:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-09 02:18:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 133 states have (on average 1.2857142857142858) internal successors, (171), 134 states have internal predecessors, (171), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:18:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 223 transitions. [2024-11-09 02:18:26,685 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 223 transitions. Word has length 127 [2024-11-09 02:18:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:26,686 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 223 transitions. [2024-11-09 02:18:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 223 transitions. [2024-11-09 02:18:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:18:26,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:26,688 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:18:26,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:18:26,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:26,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1452940036, now seen corresponding path program 1 times [2024-11-09 02:18:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:26,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103918250] [2024-11-09 02:18:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:18:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:18:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103918250] [2024-11-09 02:18:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103918250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:29,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:18:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640885257] [2024-11-09 02:18:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:29,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:18:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:18:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:18:29,174 INFO L87 Difference]: Start difference. First operand 162 states and 223 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:18:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:30,263 INFO L93 Difference]: Finished difference Result 272 states and 372 transitions. [2024-11-09 02:18:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:18:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-09 02:18:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:30,265 INFO L225 Difference]: With dead ends: 272 [2024-11-09 02:18:30,266 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 02:18:30,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:18:30,267 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:30,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 467 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:18:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 02:18:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-09 02:18:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.2814814814814814) internal successors, (173), 136 states have internal predecessors, (173), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:18:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 225 transitions. [2024-11-09 02:18:30,290 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 225 transitions. Word has length 127 [2024-11-09 02:18:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:30,291 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 225 transitions. [2024-11-09 02:18:30,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:18:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2024-11-09 02:18:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:18:30,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:30,292 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:18:30,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:18:30,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:30,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1454787078, now seen corresponding path program 1 times [2024-11-09 02:18:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165386817] [2024-11-09 02:18:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:18:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:18:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:18:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:18:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:18:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:18:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:18:31,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165386817] [2024-11-09 02:18:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165386817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:18:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354591482] [2024-11-09 02:18:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:31,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:18:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:18:31,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:18:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:18:31,816 INFO L87 Difference]: Start difference. First operand 164 states and 225 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:32,174 INFO L93 Difference]: Finished difference Result 169 states and 230 transitions. [2024-11-09 02:18:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:18:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-09 02:18:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:32,178 INFO L225 Difference]: With dead ends: 169 [2024-11-09 02:18:32,178 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 02:18:32,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:18:32,179 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 167 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:32,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 483 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:18:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 02:18:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-09 02:18:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 139 states have internal predecessors, (176), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:18:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 228 transitions. [2024-11-09 02:18:32,204 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 228 transitions. Word has length 127 [2024-11-09 02:18:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:32,205 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 228 transitions. [2024-11-09 02:18:32,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2024-11-09 02:18:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:18:32,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:32,206 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:18:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:18:32,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:32,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 322067326, now seen corresponding path program 1 times [2024-11-09 02:18:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594718549] [2024-11-09 02:18:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 02:18:32,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765713484] [2024-11-09 02:18:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:32,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:18:32,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:18:32,429 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-09 02:18:32,430 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-09 02:18:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:18:33,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:18:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:18:34,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:18:34,968 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:18:34,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:18:34,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:18:35,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 02:18:35,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:35,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:18:35,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:18:35 BoogieIcfgContainer [2024-11-09 02:18:35,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:18:35,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:18:35,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:18:35,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:18:35,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:27" (3/4) ... [2024-11-09 02:18:35,356 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:18:35,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:18:35,358 INFO L158 Benchmark]: Toolchain (without parser) took 68837.75ms. Allocated memory was 157.3MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 114.2MB in the beginning and 482.0MB in the end (delta: -367.9MB). Peak memory consumption was 562.6MB. Max. memory is 16.1GB. [2024-11-09 02:18:35,358 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:18:35,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.63ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 97.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:18:35,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.49ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 93.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:18:35,359 INFO L158 Benchmark]: Boogie Preprocessor took 59.63ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 89.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:18:35,360 INFO L158 Benchmark]: RCFGBuilder took 878.78ms. Allocated memory is still 157.3MB. Free memory was 89.5MB in the beginning and 93.9MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 02:18:35,360 INFO L158 Benchmark]: TraceAbstraction took 67456.32ms. Allocated memory was 157.3MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 93.9MB in the beginning and 483.1MB in the end (delta: -389.1MB). Peak memory consumption was 544.0MB. Max. memory is 16.1GB. [2024-11-09 02:18:35,360 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 1.1GB. Free memory is still 482.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:18:35,362 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.20ms. Allocated memory is still 100.7MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.63ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 97.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.49ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 93.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.63ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 89.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 878.78ms. Allocated memory is still 157.3MB. Free memory was 89.5MB in the beginning and 93.9MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 67456.32ms. Allocated memory was 157.3MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 93.9MB in the beginning and 483.1MB in the end (delta: -389.1MB). Peak memory consumption was 544.0MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 1.1GB. Free memory is still 482.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L57] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L65] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L66] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L67] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] signed long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L70] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L71] unsigned char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L105] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L108] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L116] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L118] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L122] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L137] RET updateVariables() [L138] CALL step() [L75] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L75] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L76] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_20_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L77] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L78] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_19_Pointer)); [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))); [L80] COND FALSE !(stepLocal_0 >= 1u) [L87] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L87] (*(WrapperStruct00_var_1_8_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L89] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_8_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=832, stepLocal_2=64] [L90] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L93] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) [L95] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=832] [L95] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) [L98] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L98] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) [L129] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129-L130] return (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.2s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2080 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2079 mSDsluCounter, 6646 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5065 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4577 IncrementalHoareTripleChecker+Invalid, 4761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 1581 mSDtfsCounter, 4577 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=14, InterpolantAutomatonStates: 112, 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, 14 MinimizatonAttempts, 161 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 2002 NumberOfCodeBlocks, 2002 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1734 ConstructedInterpolants, 0 QuantifiedInterpolants, 23269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 5096/5096 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-09 02:18:35,543 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_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:18:37,655 INFO L188 SettingsManager]: Resetting all preferences to default values...