./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-45.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 461c81c95aeb8a9614926178b98d572c91580d4459c0d235f442b13956f46559 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:52:17,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:52:17,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:52:17,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:52:17,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:52:17,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:52:17,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:52:17,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:52:17,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:52:17,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:52:17,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:52:17,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:52:17,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:52:17,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:52:17,176 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:52:17,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:52:17,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:52:17,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:52:17,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:52:17,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:52:17,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:52:17,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:52:17,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:52:17,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:52:17,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:52:17,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:52:17,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:52:17,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:52:17,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:52:17,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:52:17,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:52:17,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:52:17,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:17,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:52:17,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:52:17,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:52:17,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:52:17,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:52:17,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:52:17,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:52:17,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:52:17,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:52:17,184 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 -> 461c81c95aeb8a9614926178b98d572c91580d4459c0d235f442b13956f46559 [2024-11-12 07:52:17,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:52:17,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:52:17,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:52:17,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:52:17,401 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:52:17,402 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-45.i [2024-11-12 07:52:18,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:52:18,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:52:18,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-45.i [2024-11-12 07:52:18,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9623cf5f2/81d673e20d6e4170a06184c1eabbb09b/FLAG204b1278a [2024-11-12 07:52:19,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9623cf5f2/81d673e20d6e4170a06184c1eabbb09b [2024-11-12 07:52:19,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:52:19,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:52:19,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:19,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:52:19,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:52:19,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64df7af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19, skipping insertion in model container [2024-11-12 07:52:19,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:52:19,344 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-45.i[917,930] [2024-11-12 07:52:19,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:19,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:52:19,407 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-45.i[917,930] [2024-11-12 07:52:19,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:19,469 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:52:19,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19 WrapperNode [2024-11-12 07:52:19,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:19,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:19,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:52:19,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:52:19,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,518 INFO L138 Inliner]: procedures = 30, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2024-11-12 07:52:19,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:19,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:52:19,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:52:19,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:52:19,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,537 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:52:19,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:52:19,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:52:19,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:52:19,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:52:19,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (1/1) ... [2024-11-12 07:52:19,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:19,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:52:19,607 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-12 07:52:19,609 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-12 07:52:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:52:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:52:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:52:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:52:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:52:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:52:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:52:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:52:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:52:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:52:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:52:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:52:19,783 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:52:19,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:52:20,436 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-12 07:52:20,437 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:52:20,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:52:20,471 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:52:20,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:20 BoogieIcfgContainer [2024-11-12 07:52:20,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:52:20,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:52:20,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:52:20,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:52:20,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:52:19" (1/3) ... [2024-11-12 07:52:20,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692d0d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:20, skipping insertion in model container [2024-11-12 07:52:20,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:19" (2/3) ... [2024-11-12 07:52:20,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692d0d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:20, skipping insertion in model container [2024-11-12 07:52:20,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:20" (3/3) ... [2024-11-12 07:52:20,479 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-45.i [2024-11-12 07:52:20,492 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:52:20,492 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:52:20,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:52:20,569 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;@1a8e85a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:52:20,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:52:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 07:52:20,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:20,588 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:20,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:20,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash -185737168, now seen corresponding path program 1 times [2024-11-12 07:52:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:20,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236464190] [2024-11-12 07:52:20,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236464190] [2024-11-12 07:52:21,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236464190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:21,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:52:21,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367477166] [2024-11-12 07:52:21,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:21,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:52:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:52:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:52:21,059 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:21,095 INFO L93 Difference]: Finished difference Result 273 states and 431 transitions. [2024-11-12 07:52:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:52:21,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-11-12 07:52:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:21,104 INFO L225 Difference]: With dead ends: 273 [2024-11-12 07:52:21,104 INFO L226 Difference]: Without dead ends: 136 [2024-11-12 07:52:21,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-12 07:52:21,110 INFO L435 NwaCegarLoop]: 199 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, 199 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-12 07:52:21,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:52:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-12 07:52:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-12 07:52:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-12 07:52:21,155 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 189 [2024-11-12 07:52:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:21,155 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-12 07:52:21,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-12 07:52:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 07:52:21,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:21,161 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:52:21,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1976995918, now seen corresponding path program 1 times [2024-11-12 07:52:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345065858] [2024-11-12 07:52:21,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:23,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345065858] [2024-11-12 07:52:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345065858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:23,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:23,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:52:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353587695] [2024-11-12 07:52:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:23,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:52:23,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:23,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:52:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:52:23,883 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 07:52:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:24,205 INFO L93 Difference]: Finished difference Result 367 states and 541 transitions. [2024-11-12 07:52:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:52:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 189 [2024-11-12 07:52:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:24,210 INFO L225 Difference]: With dead ends: 367 [2024-11-12 07:52:24,211 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 07:52:24,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:52:24,214 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 180 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:24,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 547 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:52:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 07:52:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2024-11-12 07:52:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 168 states have (on average 1.3333333333333333) internal successors, (224), 168 states have internal predecessors, (224), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 07:52:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 324 transitions. [2024-11-12 07:52:24,250 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 324 transitions. Word has length 189 [2024-11-12 07:52:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:24,252 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 324 transitions. [2024-11-12 07:52:24,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 07:52:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 324 transitions. [2024-11-12 07:52:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 07:52:24,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:24,257 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:24,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:52:24,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2115807315, now seen corresponding path program 1 times [2024-11-12 07:52:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078167579] [2024-11-12 07:52:24,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:24,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078167579] [2024-11-12 07:52:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078167579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577700395] [2024-11-12 07:52:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:24,594 INFO L87 Difference]: Start difference. First operand 221 states and 324 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:24,618 INFO L93 Difference]: Finished difference Result 354 states and 520 transitions. [2024-11-12 07:52:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2024-11-12 07:52:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:24,622 INFO L225 Difference]: With dead ends: 354 [2024-11-12 07:52:24,623 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 07:52:24,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:24,625 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:24,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:52:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 07:52:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-12 07:52:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 168 states have (on average 1.3273809523809523) internal successors, (223), 168 states have internal predecessors, (223), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 07:52:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 323 transitions. [2024-11-12 07:52:24,654 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 323 transitions. Word has length 191 [2024-11-12 07:52:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:24,656 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 323 transitions. [2024-11-12 07:52:24,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2024-11-12 07:52:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 07:52:24,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:24,657 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:52:24,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:24,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1920994543, now seen corresponding path program 1 times [2024-11-12 07:52:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:24,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283417859] [2024-11-12 07:52:24,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:24,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283417859] [2024-11-12 07:52:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283417859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:24,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649724545] [2024-11-12 07:52:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:24,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:24,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:24,914 INFO L87 Difference]: Start difference. First operand 221 states and 323 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:24,930 INFO L93 Difference]: Finished difference Result 359 states and 525 transitions. [2024-11-12 07:52:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:24,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2024-11-12 07:52:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:24,932 INFO L225 Difference]: With dead ends: 359 [2024-11-12 07:52:24,932 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 07:52:24,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:24,933 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:24,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:52:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 07:52:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-12 07:52:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 168 states have internal predecessors, (221), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 07:52:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 321 transitions. [2024-11-12 07:52:24,950 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 321 transitions. Word has length 191 [2024-11-12 07:52:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:24,951 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 321 transitions. [2024-11-12 07:52:24,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 321 transitions. [2024-11-12 07:52:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 07:52:24,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:24,953 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:24,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:52:24,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:24,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1498292717, now seen corresponding path program 1 times [2024-11-12 07:52:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:24,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014122074] [2024-11-12 07:52:24,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:24,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014122074] [2024-11-12 07:52:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014122074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:26,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:52:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923614710] [2024-11-12 07:52:26,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:26,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:52:26,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:52:26,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:52:26,446 INFO L87 Difference]: Start difference. First operand 221 states and 321 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:27,545 INFO L93 Difference]: Finished difference Result 412 states and 597 transitions. [2024-11-12 07:52:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:52:27,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2024-11-12 07:52:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:27,547 INFO L225 Difference]: With dead ends: 412 [2024-11-12 07:52:27,547 INFO L226 Difference]: Without dead ends: 279 [2024-11-12 07:52:27,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:52:27,548 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 275 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:27,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 605 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 07:52:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-12 07:52:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2024-11-12 07:52:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 181 states have (on average 1.3149171270718232) internal successors, (238), 181 states have internal predecessors, (238), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 07:52:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 338 transitions. [2024-11-12 07:52:27,572 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 338 transitions. Word has length 191 [2024-11-12 07:52:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 338 transitions. [2024-11-12 07:52:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 338 transitions. [2024-11-12 07:52:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 07:52:27,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:27,575 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:27,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:52:27,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2095610001, now seen corresponding path program 1 times [2024-11-12 07:52:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75596960] [2024-11-12 07:52:27,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:27,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:27,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75596960] [2024-11-12 07:52:27,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75596960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:27,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:27,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:27,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305041692] [2024-11-12 07:52:27,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:27,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:27,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:27,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:27,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:27,851 INFO L87 Difference]: Start difference. First operand 234 states and 338 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:27,873 INFO L93 Difference]: Finished difference Result 369 states and 535 transitions. [2024-11-12 07:52:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:27,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2024-11-12 07:52:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:27,875 INFO L225 Difference]: With dead ends: 369 [2024-11-12 07:52:27,875 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 07:52:27,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:27,876 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:27,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:52:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 07:52:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 136. [2024-11-12 07:52:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 109 states have internal predecessors, (146), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions. [2024-11-12 07:52:27,890 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 191 [2024-11-12 07:52:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:27,890 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions. [2024-11-12 07:52:27,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions. [2024-11-12 07:52:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 07:52:27,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:27,892 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:27,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:52:27,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:27,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash 252825766, now seen corresponding path program 1 times [2024-11-12 07:52:27,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:27,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037681128] [2024-11-12 07:52:27,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:27,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:28,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037681128] [2024-11-12 07:52:28,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037681128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:28,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086887510] [2024-11-12 07:52:28,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:28,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:52:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:28,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:52:28,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:52:28,156 INFO L87 Difference]: Start difference. First operand 136 states and 196 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:28,247 INFO L93 Difference]: Finished difference Result 276 states and 398 transitions. [2024-11-12 07:52:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:52:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-12 07:52:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:28,249 INFO L225 Difference]: With dead ends: 276 [2024-11-12 07:52:28,249 INFO L226 Difference]: Without dead ends: 143 [2024-11-12 07:52:28,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:52:28,250 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 7 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:28,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 697 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:52:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-12 07:52:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2024-11-12 07:52:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 112 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 199 transitions. [2024-11-12 07:52:28,260 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 199 transitions. Word has length 192 [2024-11-12 07:52:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:28,260 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 199 transitions. [2024-11-12 07:52:28,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 199 transitions. [2024-11-12 07:52:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 07:52:28,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:28,262 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:28,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:52:28,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1335522136, now seen corresponding path program 1 times [2024-11-12 07:52:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791844298] [2024-11-12 07:52:28,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:52:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:52:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:52:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:52:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:52:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:52:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:52:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:52:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:52:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:52:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:52:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:52:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:52:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:52:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:52:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 07:52:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 07:52:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 07:52:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 07:52:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 07:52:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 07:52:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 07:52:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791844298] [2024-11-12 07:52:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791844298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:52:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696094030] [2024-11-12 07:52:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:52:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:52:29,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:52:29,370 INFO L87 Difference]: Start difference. First operand 139 states and 199 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 07:52:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:30,591 INFO L93 Difference]: Finished difference Result 332 states and 474 transitions. [2024-11-12 07:52:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:52:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 192 [2024-11-12 07:52:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:30,593 INFO L225 Difference]: With dead ends: 332 [2024-11-12 07:52:30,593 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 07:52:30,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:52:30,595 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 688 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:30,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 599 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:52:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 07:52:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2024-11-12 07:52:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.3384615384615384) internal successors, (174), 130 states have internal predecessors, (174), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 224 transitions. [2024-11-12 07:52:30,607 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 224 transitions. Word has length 192 [2024-11-12 07:52:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:30,609 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 224 transitions. [2024-11-12 07:52:30,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 07:52:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 224 transitions. [2024-11-12 07:52:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 07:52:30,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:30,611 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:52:30,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:30,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2036586714, now seen corresponding path program 1 times [2024-11-12 07:52:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444836340] [2024-11-12 07:52:30,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:52:30,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038446935] [2024-11-12 07:52:30,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:30,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:52:30,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:52:30,736 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-12 07:52:30,738 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-12 07:52:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:52:32,677 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:52:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:52:34,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:52:34,113 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:52:34,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:52:34,130 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-12 07:52:34,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:52:34,318 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:52:34,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:52:34,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:52:34 BoogieIcfgContainer [2024-11-12 07:52:34,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:52:34,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:52:34,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:52:34,452 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:52:34,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:20" (3/4) ... [2024-11-12 07:52:34,455 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:52:34,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:52:34,456 INFO L158 Benchmark]: Toolchain (without parser) took 15304.00ms. Allocated memory was 138.4MB in the beginning and 557.8MB in the end (delta: 419.4MB). Free memory was 69.4MB in the beginning and 330.9MB in the end (delta: -261.5MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2024-11-12 07:52:34,456 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 105.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:52:34,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.33ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 69.2MB in the beginning and 144.6MB in the end (delta: -75.4MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-12 07:52:34,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.88ms. Allocated memory is still 186.6MB. Free memory was 144.6MB in the beginning and 139.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:52:34,457 INFO L158 Benchmark]: Boogie Preprocessor took 57.04ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 135.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:52:34,457 INFO L158 Benchmark]: RCFGBuilder took 893.91ms. Allocated memory is still 186.6MB. Free memory was 135.3MB in the beginning and 152.7MB in the end (delta: -17.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-12 07:52:34,457 INFO L158 Benchmark]: TraceAbstraction took 13977.34ms. Allocated memory was 186.6MB in the beginning and 557.8MB in the end (delta: 371.2MB). Free memory was 151.8MB in the beginning and 330.9MB in the end (delta: -179.1MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. [2024-11-12 07:52:34,457 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 557.8MB. Free memory is still 330.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:52:34,458 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.16ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 105.0MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.33ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 69.2MB in the beginning and 144.6MB in the end (delta: -75.4MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.88ms. Allocated memory is still 186.6MB. Free memory was 144.6MB in the beginning and 139.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.04ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 135.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 893.91ms. Allocated memory is still 186.6MB. Free memory was 135.3MB in the beginning and 152.7MB in the end (delta: -17.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13977.34ms. Allocated memory was 186.6MB in the beginning and 557.8MB in the end (delta: 371.2MB). Free memory was 151.8MB in the beginning and 330.9MB in the end (delta: -179.1MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 557.8MB. Free memory is still 330.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 999999.2, 5, -2, 0.0, 5.9, 255.6, 25.5, 0, 0.0, 1, 0, 0, 0, 1, 1, 64, -10, 5 }; [L63] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L64] unsigned short int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L65] signed long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L66] double* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L67] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L68] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L69] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L70] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L71] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L72] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L73] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L74] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L75] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L76] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L77] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L78] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L79] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L80] unsigned char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L81] unsigned char last_1_WrapperStruct00_var_1_18 = 64; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=0, last_1_WrapperStruct00_var_1_18=64] [L153] isInitial = 1 [L154] FCALL initially() [L155] COND TRUE 1 [L156] CALL updateLastVariables() [L146] EXPR WrapperStruct00.var_1_18 [L146] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L156] RET updateLastVariables() [L157] CALL updateVariables() [L105] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L107] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L108] WrapperStruct00.var_1_4 = __VERIFIER_nondet_long() [L109] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L111] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_6 [L112] EXPR WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_6 [L112] EXPR WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] EXPR (WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L113] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_7 [L114] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_7 [L114] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L116] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L117] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L120] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_11 [L121] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_11 [L121] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L126] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L127] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L128] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L129] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L130] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L132] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L133] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L134] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L135] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L136] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L137] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L138] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L139] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L139] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L139] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L140] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L140] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L140] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L141] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L142] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L142] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L142] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L143] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L143] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L143] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L157] RET updateVariables() [L158] CALL step() [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L85] COND TRUE (((*(WrapperStruct00_var_1_2_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))) / (*(WrapperStruct00_var_1_19_Pointer))) != last_1_WrapperStruct00_var_1_18 [L86] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L86] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_20_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L88] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L88] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L88] COND TRUE ((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer))))) [L89] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L89] (*(WrapperStruct00_var_1_1_Pointer)) = (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L93] COND TRUE (*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_18_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] COND TRUE (*(WrapperStruct00_var_1_10_Pointer)) [L95] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L95] EXPR (*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer)) [L95] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L95] EXPR (*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L95] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))) [L100] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L100] COND FALSE !((*(WrapperStruct00_var_1_12_Pointer))) [L158] RET step() [L159] CALL, EXPR property() [L149] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L149] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L149] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L149] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L149] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer))) [L149] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L149] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L149] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) [L149] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L149] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L149] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L149] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L149] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L149] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))) - ((*(WrapperStruct00_var_1_11_Pointer)) - 0.8f)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L149] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))) - ((*(WrapperStruct00_var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_18_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((*(WrapperStruct00_var_1_8_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))) && (((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) && (*(WrapperStruct00_var_1_17_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L149] EXPR ((((((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))) - ((*(WrapperStruct00_var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_18_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((*(WrapperStruct00_var_1_8_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))) && (((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) && (*(WrapperStruct00_var_1_17_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_2_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))) / (*(WrapperStruct00_var_1_19_Pointer))) != last_1_WrapperStruct00_var_1_18) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L149-L150] return ((((((*(WrapperStruct00_var_1_18_Pointer)) / 32) < ((((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_18_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer))) - (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))) - ((*(WrapperStruct00_var_1_11_Pointer)) - 0.8f)))) : 1)) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_18_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((*(WrapperStruct00_var_1_8_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))) && (((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) && (*(WrapperStruct00_var_1_17_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_2_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))) / (*(WrapperStruct00_var_1_19_Pointer))) != last_1_WrapperStruct00_var_1_18) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) : 1) ; [L159] RET, EXPR property() [L159] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:42}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:49}, WrapperStruct00_var_1_15_Pointer={4:50}, WrapperStruct00_var_1_16_Pointer={4:51}, WrapperStruct00_var_1_17_Pointer={4:52}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:54}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:55}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:22}, WrapperStruct00_var_1_8_Pointer={4:30}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 9, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1150 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1150 mSDsluCounter, 3810 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2445 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1876 IncrementalHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 1365 mSDtfsCounter, 1876 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 188 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1910 NumberOfCodeBlocks, 1910 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1518 ConstructedInterpolants, 0 QuantifiedInterpolants, 7342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9600/9600 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-12 07:52:34,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-45.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 461c81c95aeb8a9614926178b98d572c91580d4459c0d235f442b13956f46559 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:52:36,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:52:36,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:52:36,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:52:36,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:52:36,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:52:36,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:52:36,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:52:36,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:52:36,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:52:36,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:52:36,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:52:36,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:52:36,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:52:36,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:52:36,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:52:36,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:52:36,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:52:36,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:52:36,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:52:36,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:52:36,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:52:36,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:52:36,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:52:36,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:52:36,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:52:36,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:52:36,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:52:36,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:52:36,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:52:36,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:52:36,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:52:36,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:52:36,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:52:36,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:36,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:52:36,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:52:36,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:52:36,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:52:36,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:52:36,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:52:36,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:52:36,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:52:36,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:52:36,420 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 -> 461c81c95aeb8a9614926178b98d572c91580d4459c0d235f442b13956f46559 [2024-11-12 07:52:36,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:52:36,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:52:36,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:52:36,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:52:36,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:52:36,672 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-45.i [2024-11-12 07:52:37,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:52:38,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:52:38,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-45.i [2024-11-12 07:52:38,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73bd895/dac3706e61e7447ea6007313c03a7901/FLAG75bac462f [2024-11-12 07:52:38,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73bd895/dac3706e61e7447ea6007313c03a7901 [2024-11-12 07:52:38,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:52:38,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:52:38,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:38,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:52:38,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:52:38,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1020ed53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38, skipping insertion in model container [2024-11-12 07:52:38,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:52:38,603 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-45.i[917,930] [2024-11-12 07:52:38,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:38,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:52:38,708 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-45.i[917,930] [2024-11-12 07:52:38,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:38,785 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:52:38,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38 WrapperNode [2024-11-12 07:52:38,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:38,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:38,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:52:38,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:52:38,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,856 INFO L138 Inliner]: procedures = 40, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-11-12 07:52:38,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:38,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:52:38,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:52:38,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:52:38,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,905 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 39 writes are split as follows [0, 39]. [2024-11-12 07:52:38,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:52:38,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:52:38,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:52:38,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:52:38,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (1/1) ... [2024-11-12 07:52:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:52:38,970 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-12 07:52:38,973 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-12 07:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-12 07:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-12 07:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:52:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:52:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:52:39,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:52:39,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:52:46,404 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-12 07:52:46,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:52:46,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:52:46,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:52:46,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:46 BoogieIcfgContainer [2024-11-12 07:52:46,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:52:46,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:52:46,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:52:46,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:52:46,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:52:38" (1/3) ... [2024-11-12 07:52:46,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5993bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:46, skipping insertion in model container [2024-11-12 07:52:46,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:38" (2/3) ... [2024-11-12 07:52:46,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5993bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:46, skipping insertion in model container [2024-11-12 07:52:46,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:46" (3/3) ... [2024-11-12 07:52:46,422 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-45.i [2024-11-12 07:52:46,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:52:46,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:52:46,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:52:46,499 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;@5a829c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:52:46,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:52:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 07:52:46,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:46,518 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:46,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:46,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash -299657412, now seen corresponding path program 1 times [2024-11-12 07:52:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214404114] [2024-11-12 07:52:46,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:46,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:46,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:46,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:52:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:47,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:52:47,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2024-11-12 07:52:47,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:47,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:47,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214404114] [2024-11-12 07:52:47,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214404114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:47,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:52:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531076962] [2024-11-12 07:52:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:47,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:52:47,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:52:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:52:47,146 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:47,172 INFO L93 Difference]: Finished difference Result 273 states and 431 transitions. [2024-11-12 07:52:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:52:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-11-12 07:52:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:47,179 INFO L225 Difference]: With dead ends: 273 [2024-11-12 07:52:47,180 INFO L226 Difference]: Without dead ends: 136 [2024-11-12 07:52:47,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 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-12 07:52:47,184 INFO L435 NwaCegarLoop]: 199 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, 199 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-12 07:52:47,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:52:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-12 07:52:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-12 07:52:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-12 07:52:47,220 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 189 [2024-11-12 07:52:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:47,220 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-12 07:52:47,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-12 07:52:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 07:52:47,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:47,224 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:47,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:52:47,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:47,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1863075674, now seen corresponding path program 1 times [2024-11-12 07:52:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911724878] [2024-11-12 07:52:47,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:47,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:47,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:47,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:47,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:52:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:47,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:52:47,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-12 07:52:47,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:47,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:47,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911724878] [2024-11-12 07:52:47,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911724878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:47,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:47,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:52:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199665714] [2024-11-12 07:52:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:47,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:52:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:47,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:52:47,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:52:47,979 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:48,048 INFO L93 Difference]: Finished difference Result 271 states and 398 transitions. [2024-11-12 07:52:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:52:48,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2024-11-12 07:52:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:48,053 INFO L225 Difference]: With dead ends: 271 [2024-11-12 07:52:48,054 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:52:48,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 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-12 07:52:48,057 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:48,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:52:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:52:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-12 07:52:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-11-12 07:52:48,073 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 189 [2024-11-12 07:52:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:48,077 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-11-12 07:52:48,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-11-12 07:52:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 07:52:48,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:48,080 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:48,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:52:48,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:48,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:48,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1891462116, now seen corresponding path program 1 times [2024-11-12 07:52:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:48,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255855742] [2024-11-12 07:52:48,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:48,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:48,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:48,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:48,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:52:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:48,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:52:48,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:48,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:52:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:48,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:48,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255855742] [2024-11-12 07:52:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255855742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699184746] [2024-11-12 07:52:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:48,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:48,916 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:49,609 INFO L93 Difference]: Finished difference Result 273 states and 399 transitions. [2024-11-12 07:52:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:49,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2024-11-12 07:52:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:49,612 INFO L225 Difference]: With dead ends: 273 [2024-11-12 07:52:49,612 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:52:49,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:49,613 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:49,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:52:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:52:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-12 07:52:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 111 states have internal predecessors, (150), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 200 transitions. [2024-11-12 07:52:49,621 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 200 transitions. Word has length 189 [2024-11-12 07:52:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:49,621 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 200 transitions. [2024-11-12 07:52:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2024-11-12 07:52:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 07:52:49,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:49,623 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:49,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:52:49,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:49,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:49,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 714561438, now seen corresponding path program 1 times [2024-11-12 07:52:49,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:49,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639214361] [2024-11-12 07:52:49,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:49,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:49,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:49,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:49,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:52:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:50,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:52:50,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:50,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 07:52:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:50,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:50,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639214361] [2024-11-12 07:52:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639214361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741470192] [2024-11-12 07:52:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:50,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:50,354 INFO L87 Difference]: Start difference. First operand 138 states and 200 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:50,376 INFO L93 Difference]: Finished difference Result 273 states and 397 transitions. [2024-11-12 07:52:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:50,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2024-11-12 07:52:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:50,378 INFO L225 Difference]: With dead ends: 273 [2024-11-12 07:52:50,378 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:52:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:50,379 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:50,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:52:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:52:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-12 07:52:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 111 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-12 07:52:50,386 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 189 [2024-11-12 07:52:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:50,386 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-12 07:52:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-12 07:52:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 07:52:50,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:50,388 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:50,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:52:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:50,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -93350882, now seen corresponding path program 1 times [2024-11-12 07:52:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194569049] [2024-11-12 07:52:50,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:50,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:50,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:50,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:52:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:51,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:52:51,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:51,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-12 07:52:51,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 07:52:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 07:52:51,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:51,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:51,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194569049] [2024-11-12 07:52:51,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194569049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:51,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:51,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767075130] [2024-11-12 07:52:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:51,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:52:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:52:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:52:51,133 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:53,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:52:55,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:52:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:55,913 INFO L93 Difference]: Finished difference Result 280 states and 404 transitions. [2024-11-12 07:52:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:52:55,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2024-11-12 07:52:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:55,917 INFO L225 Difference]: With dead ends: 280 [2024-11-12 07:52:55,917 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 07:52:55,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:52:55,918 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 7 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:55,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 672 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-12 07:52:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 07:52:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-11-12 07:52:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 114 states have internal predecessors, (152), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:52:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-12 07:52:55,931 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 192 [2024-11-12 07:52:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-12 07:52:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 07:52:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-12 07:52:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 07:52:55,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:55,934 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:52:55,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:52:56,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:56,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1681698784, now seen corresponding path program 1 times [2024-11-12 07:52:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:56,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012979907] [2024-11-12 07:52:56,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:52:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:56,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:52:56,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:52:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:56,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:52:56,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:56,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:52:56,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-11-12 07:52:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-12 07:52:56,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:56,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012979907] [2024-11-12 07:52:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012979907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554060328] [2024-11-12 07:52:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:56,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:52:56,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:52:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:52:56,853 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:52:59,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:03,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:06,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:06,247 INFO L93 Difference]: Finished difference Result 280 states and 402 transitions. [2024-11-12 07:53:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:53:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2024-11-12 07:53:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:06,249 INFO L225 Difference]: With dead ends: 280 [2024-11-12 07:53:06,249 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:53:06,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:53:06,250 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 176 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:53:06,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 573 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-12 07:53:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:53:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-12 07:53:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:53:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 201 transitions. [2024-11-12 07:53:06,256 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 201 transitions. Word has length 192 [2024-11-12 07:53:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:06,256 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 201 transitions. [2024-11-12 07:53:06,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:53:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 201 transitions. [2024-11-12 07:53:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 07:53:06,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:06,258 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:53:06,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:53:06,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:06,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2017637852, now seen corresponding path program 1 times [2024-11-12 07:53:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501179567] [2024-11-12 07:53:06,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:06,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:06,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:06,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:53:06,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:53:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:06,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:53:06,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-11-12 07:53:06,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:53:06,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501179567] [2024-11-12 07:53:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501179567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:53:06,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:53:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:53:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502672235] [2024-11-12 07:53:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:53:06,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:53:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:53:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:53:06,978 INFO L87 Difference]: Start difference. First operand 141 states and 201 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 07:53:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:07,223 INFO L93 Difference]: Finished difference Result 283 states and 404 transitions. [2024-11-12 07:53:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:53:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2024-11-12 07:53:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:07,225 INFO L225 Difference]: With dead ends: 283 [2024-11-12 07:53:07,225 INFO L226 Difference]: Without dead ends: 143 [2024-11-12 07:53:07,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:53:07,226 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:53:07,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 778 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:53:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-12 07:53:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-12 07:53:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:53:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 200 transitions. [2024-11-12 07:53:07,233 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 200 transitions. Word has length 194 [2024-11-12 07:53:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:07,233 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 200 transitions. [2024-11-12 07:53:07,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-12 07:53:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 200 transitions. [2024-11-12 07:53:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 07:53:07,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:07,235 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:53:07,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:53:07,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:07,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:07,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1707057638, now seen corresponding path program 1 times [2024-11-12 07:53:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:07,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878266260] [2024-11-12 07:53:07,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:07,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:53:07,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:53:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:07,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:53:07,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:08,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:53:08,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:53:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-12 07:53:08,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:53:08,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:08,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878266260] [2024-11-12 07:53:08,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878266260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:53:08,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:53:08,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:53:08,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902096850] [2024-11-12 07:53:08,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:53:08,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:53:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:53:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:53:08,116 INFO L87 Difference]: Start difference. First operand 141 states and 200 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:53:12,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:14,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:16,318 INFO L93 Difference]: Finished difference Result 280 states and 398 transitions. [2024-11-12 07:53:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:53:16,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 194 [2024-11-12 07:53:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:16,320 INFO L225 Difference]: With dead ends: 280 [2024-11-12 07:53:16,320 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:53:16,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:53:16,321 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 166 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:53:16,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 565 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2024-11-12 07:53:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:53:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-12 07:53:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:53:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2024-11-12 07:53:16,332 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 194 [2024-11-12 07:53:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:16,332 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2024-11-12 07:53:16,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:53:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2024-11-12 07:53:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 07:53:16,334 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:16,334 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:53:16,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:53:16,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:16,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1158026144, now seen corresponding path program 1 times [2024-11-12 07:53:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090448006] [2024-11-12 07:53:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:16,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:53:16,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:53:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:17,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:53:17,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:17,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:53:17,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:53:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-11-12 07:53:17,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:53:17,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090448006] [2024-11-12 07:53:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090448006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:53:17,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:53:17,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:53:17,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504643646] [2024-11-12 07:53:17,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:53:17,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:53:17,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:17,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:53:17,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:53:17,224 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:53:19,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:23,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:25,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:25,672 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2024-11-12 07:53:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:53:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 196 [2024-11-12 07:53:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:25,674 INFO L225 Difference]: With dead ends: 279 [2024-11-12 07:53:25,674 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 07:53:25,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:53:25,675 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 158 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:53:25,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 559 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-12 07:53:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 07:53:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-12 07:53:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:53:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2024-11-12 07:53:25,680 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 196 transitions. Word has length 196 [2024-11-12 07:53:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:25,680 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 196 transitions. [2024-11-12 07:53:25,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:53:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2024-11-12 07:53:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 07:53:25,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:25,681 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:53:25,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-12 07:53:25,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:25,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:25,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash -509197400, now seen corresponding path program 1 times [2024-11-12 07:53:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:25,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582853490] [2024-11-12 07:53:25,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:25,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:25,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:25,886 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:53:25,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:53:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:26,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:53:26,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:26,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:53:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-12 07:53:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 504 proven. 24 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-12 07:53:26,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:53:26,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:53:26,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-12 07:53:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 07:53:27,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582853490] [2024-11-12 07:53:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582853490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:53:27,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:53:27,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:53:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799581813] [2024-11-12 07:53:27,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:53:27,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:53:27,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:27,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:53:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:53:27,016 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-11-12 07:53:30,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:33,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:36,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:41,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:44,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:44,551 INFO L93 Difference]: Finished difference Result 288 states and 404 transitions. [2024-11-12 07:53:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:53:44,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) Word has length 198 [2024-11-12 07:53:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:44,552 INFO L225 Difference]: With dead ends: 288 [2024-11-12 07:53:44,552 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 07:53:44,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:53:44,553 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 148 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:53:44,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 942 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2024-11-12 07:53:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 07:53:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-12 07:53:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 112 states have internal predecessors, (144), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 07:53:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-11-12 07:53:44,566 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 198 [2024-11-12 07:53:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:44,566 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-11-12 07:53:44,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-11-12 07:53:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-11-12 07:53:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 07:53:44,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:44,567 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:53:44,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 07:53:44,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:44,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:44,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1854644262, now seen corresponding path program 1 times [2024-11-12 07:53:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925297754] [2024-11-12 07:53:44,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:44,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:53:44,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:44,770 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:53:44,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:53:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:45,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:53:45,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:45,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2024-11-12 07:53:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-12 07:53:45,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:53:45,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:45,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925297754] [2024-11-12 07:53:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925297754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:53:45,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:53:45,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:53:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757090778] [2024-11-12 07:53:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:53:45,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:53:45,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:45,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:53:45,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:53:45,506 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 07:53:48,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:53:52,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []