./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.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 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:14,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:15,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:13:15,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:15,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:15,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:15,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:15,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:15,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:15,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:15,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:15,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:15,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:15,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:15,090 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:15,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:15,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:15,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:15,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:13:15,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:15,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:15,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:15,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:15,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:15,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:15,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:15,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:15,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:15,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:15,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:15,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:15,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:15,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:15,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:15,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:15,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:15,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:13:15,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:13:15,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:15,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:15,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:15,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:15,103 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 -> 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 [2024-11-09 02:13:15,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:15,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:15,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:15,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:15,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:15,400 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-41.i [2024-11-09 02:13:16,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:17,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:17,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-09 02:13:17,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cd27266/d068177314064ab6bcc2628f9e97fbe1/FLAGbf13e776c [2024-11-09 02:13:17,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cd27266/d068177314064ab6bcc2628f9e97fbe1 [2024-11-09 02:13:17,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:17,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:17,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:17,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:17,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:17,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140c5df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17, skipping insertion in model container [2024-11-09 02:13:17,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:17,376 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-41.i[917,930] [2024-11-09 02:13:17,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:17,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:17,495 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-41.i[917,930] [2024-11-09 02:13:17,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:17,572 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:17,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17 WrapperNode [2024-11-09 02:13:17,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:17,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:17,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:17,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:17,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,656 INFO L138 Inliner]: procedures = 30, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2024-11-09 02:13:17,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:17,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:17,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:17,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:17,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,717 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:13:17,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:17,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:17,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:17,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:17,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (1/1) ... [2024-11-09 02:13:17,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:17,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:17,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:13:17,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:13:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:13:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:13:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:13:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:13:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:13:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:13:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:13:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:18,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:18,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:13:18,527 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-09 02:13:18,527 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:13:18,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:13:18,543 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:13:18,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:18 BoogieIcfgContainer [2024-11-09 02:13:18,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:13:18,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:13:18,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:13:18,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:13:18,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:17" (1/3) ... [2024-11-09 02:13:18,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe38e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:18, skipping insertion in model container [2024-11-09 02:13:18,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:17" (2/3) ... [2024-11-09 02:13:18,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe38e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:18, skipping insertion in model container [2024-11-09 02:13:18,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:18" (3/3) ... [2024-11-09 02:13:18,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-09 02:13:18,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:13:18,578 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:13:18,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:13:18,640 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;@1a88c504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:13:18,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:13:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:13:18,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:18,655 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:18,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:18,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 87027742, now seen corresponding path program 1 times [2024-11-09 02:13:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246765127] [2024-11-09 02:13:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246765127] [2024-11-09 02:13:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246765127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:19,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:13:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970242975] [2024-11-09 02:13:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:13:19,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:13:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:19,248 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:13:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:19,298 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-11-09 02:13:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:13:19,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-09 02:13:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:19,309 INFO L225 Difference]: With dead ends: 167 [2024-11-09 02:13:19,309 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 02:13:19,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:19,318 INFO L432 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:19,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 02:13:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 02:13:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-09 02:13:19,369 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2024-11-09 02:13:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:19,370 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-09 02:13:19,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:13:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-09 02:13:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:13:19,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:19,375 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:19,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:13:19,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:19,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1324648994, now seen corresponding path program 1 times [2024-11-09 02:13:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915124942] [2024-11-09 02:13:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:19,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915124942] [2024-11-09 02:13:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915124942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:13:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213476516] [2024-11-09 02:13:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:13:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:13:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:19,794 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:19,843 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-09 02:13:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:19,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-09 02:13:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:19,846 INFO L225 Difference]: With dead ends: 162 [2024-11-09 02:13:19,846 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 02:13:19,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:19,848 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:19,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 02:13:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-09 02:13:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-09 02:13:19,861 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2024-11-09 02:13:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-09 02:13:19,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-09 02:13:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:13:19,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:19,868 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:13:19,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2004707364, now seen corresponding path program 1 times [2024-11-09 02:13:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603321747] [2024-11-09 02:13:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603321747] [2024-11-09 02:13:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603321747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:13:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521231215] [2024-11-09 02:13:20,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:20,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:13:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:13:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:13:20,678 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:21,013 INFO L93 Difference]: Finished difference Result 191 states and 269 transitions. [2024-11-09 02:13:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:13:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-09 02:13:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:21,018 INFO L225 Difference]: With dead ends: 191 [2024-11-09 02:13:21,018 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:13:21,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:13:21,021 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:21,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 378 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:13:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:13:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2024-11-09 02:13:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-09 02:13:21,037 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 114 [2024-11-09 02:13:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:21,038 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-09 02:13:21,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-11-09 02:13:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 02:13:21,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:21,041 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:21,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:13:21,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:21,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 299123064, now seen corresponding path program 1 times [2024-11-09 02:13:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486274038] [2024-11-09 02:13:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486274038] [2024-11-09 02:13:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486274038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:21,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:13:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503100871] [2024-11-09 02:13:21,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:13:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:13:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:21,330 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:21,342 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2024-11-09 02:13:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:13:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-09 02:13:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:21,344 INFO L225 Difference]: With dead ends: 162 [2024-11-09 02:13:21,344 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 02:13:21,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-09 02:13:21,346 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 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-09 02:13:21,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 02:13:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 02:13:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-09 02:13:21,363 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 115 [2024-11-09 02:13:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:21,364 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-09 02:13:21,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-09 02:13:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:13:21,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:21,366 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:21,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:13:21,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:21,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1431064419, now seen corresponding path program 1 times [2024-11-09 02:13:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348482879] [2024-11-09 02:13:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:13:21,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:13:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:13:21,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:13:21,801 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:13:21,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:13:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:13:21,810 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 02:13:21,955 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:13:21,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:13:21 BoogieIcfgContainer [2024-11-09 02:13:21,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:13:21,960 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:13:21,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:13:21,961 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:13:21,961 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:18" (3/4) ... [2024-11-09 02:13:21,964 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:13:21,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:13:21,967 INFO L158 Benchmark]: Toolchain (without parser) took 4830.61ms. Allocated memory was 138.4MB in the beginning and 268.4MB in the end (delta: 130.0MB). Free memory was 65.8MB in the beginning and 131.6MB in the end (delta: -65.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,967 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:13:21,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.86ms. Allocated memory is still 138.4MB. Free memory was 65.5MB in the beginning and 49.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.05ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 49.0MB in the beginning and 176.0MB in the end (delta: -127.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,968 INFO L158 Benchmark]: Boogie Preprocessor took 102.35ms. Allocated memory is still 207.6MB. Free memory was 175.9MB in the beginning and 173.7MB in the end (delta: 2.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,969 INFO L158 Benchmark]: RCFGBuilder took 784.04ms. Allocated memory is still 207.6MB. Free memory was 173.7MB in the beginning and 142.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,969 INFO L158 Benchmark]: TraceAbstraction took 3413.20ms. Allocated memory was 207.6MB in the beginning and 268.4MB in the end (delta: 60.8MB). Free memory was 141.2MB in the beginning and 132.7MB in the end (delta: 8.5MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,969 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 268.4MB. Free memory was 132.7MB in the beginning and 131.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:21,971 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.86ms. Allocated memory is still 138.4MB. Free memory was 65.5MB in the beginning and 49.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.05ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 49.0MB in the beginning and 176.0MB in the end (delta: -127.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.35ms. Allocated memory is still 207.6MB. Free memory was 175.9MB in the beginning and 173.7MB in the end (delta: 2.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 784.04ms. Allocated memory is still 207.6MB. Free memory was 173.7MB in the beginning and 142.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3413.20ms. Allocated memory was 207.6MB in the beginning and 268.4MB in the end (delta: 60.8MB). Free memory was 141.2MB in the beginning and 132.7MB in the end (delta: 8.5MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Witness Printer took 6.15ms. Allocated memory is still 268.4MB. Free memory was 132.7MB in the beginning and 131.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryArithmeticDOUBLEoperation at line 70. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L57] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L58] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L59] signed long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L60] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L61] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L62] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L63] signed char last_1_WrapperStruct00_var_1_1 = -16; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=0, last_1_WrapperStruct00_var_1_1=-16] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_1 [L121] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L132] RET updateVariables() [L133] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L67] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) [L68] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L68] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L70] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3) [L71] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_1=1] [L72] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) && stepLocal_1 [L73] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L73] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L77] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L78] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L86] unsigned long int stepLocal_0 = ((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_0=0] [L87] COND FALSE !(stepLocal_0 > (*(WrapperStruct00_var_1_8_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L94] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer)))) [L124] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L124] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L124] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))) [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3))) [L124] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L124] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124-L125] return ((((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 451 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:13:22,017 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-41.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 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:24,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:24,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:13:24,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:24,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:24,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:24,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:24,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:24,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:24,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:24,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:24,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:24,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:24,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:24,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:24,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:24,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:24,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:24,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:24,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:24,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:24,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:24,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:24,463 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:13:24,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:13:24,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:24,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:13:24,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:24,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:24,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:24,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:24,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:24,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:24,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:24,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:24,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:24,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:24,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:24,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:13:24,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:13:24,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:24,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:24,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:24,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:24,470 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 -> 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 [2024-11-09 02:13:24,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:24,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:24,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:24,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:24,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:24,830 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-41.i [2024-11-09 02:13:26,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:26,714 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:26,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-09 02:13:26,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee3a56b0c/e1c1e0151d3d4a14aa33d4152a2506a9/FLAG14df88cf2 [2024-11-09 02:13:27,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee3a56b0c/e1c1e0151d3d4a14aa33d4152a2506a9 [2024-11-09 02:13:27,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:27,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:27,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:27,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:27,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:27,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729178e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27, skipping insertion in model container [2024-11-09 02:13:27,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:27,271 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-41.i[917,930] [2024-11-09 02:13:27,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:27,348 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:27,362 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-41.i[917,930] [2024-11-09 02:13:27,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:27,450 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:27,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27 WrapperNode [2024-11-09 02:13:27,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:27,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:27,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:27,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:27,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,529 INFO L138 Inliner]: procedures = 37, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2024-11-09 02:13:27,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:27,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:27,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:27,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:27,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,593 INFO L175 MemorySlicer]: Split 112 memory accesses to 2 slices as follows [2, 110]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2024-11-09 02:13:27,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:27,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:27,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:27,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:27,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:27,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:27,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:13:27,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:13:27,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:13:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:13:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:13:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:13:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:13:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:13:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:13:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:13:27,906 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:27,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:13:28,990 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-09 02:13:28,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:13:29,003 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:13:29,003 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:13:29,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:29 BoogieIcfgContainer [2024-11-09 02:13:29,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:13:29,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:13:29,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:13:29,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:13:29,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:27" (1/3) ... [2024-11-09 02:13:29,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d7ff00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:29, skipping insertion in model container [2024-11-09 02:13:29,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (2/3) ... [2024-11-09 02:13:29,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d7ff00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:29, skipping insertion in model container [2024-11-09 02:13:29,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:29" (3/3) ... [2024-11-09 02:13:29,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-09 02:13:29,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:13:29,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:13:29,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:13:29,107 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;@6432710b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:13:29,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:13:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:13:29,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:29,123 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:29,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1210687020, now seen corresponding path program 1 times [2024-11-09 02:13:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410467058] [2024-11-09 02:13:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:29,146 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-09 02:13:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:29,150 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-09 02:13:29,151 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-09 02:13:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:29,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:13:29,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-09 02:13:29,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:29,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410467058] [2024-11-09 02:13:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410467058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:13:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506639248] [2024-11-09 02:13:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:29,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:13:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:13:29,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:29,690 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:13:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:29,726 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-11-09 02:13:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:13:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-09 02:13:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:29,738 INFO L225 Difference]: With dead ends: 167 [2024-11-09 02:13:29,748 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 02:13:29,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:29,758 INFO L432 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:29,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 02:13:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 02:13:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-09 02:13:29,811 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2024-11-09 02:13:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:29,812 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-09 02:13:29,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:13:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-09 02:13:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:13:29,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:29,815 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:29,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:13:30,017 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-09 02:13:30,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:30,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:30,020 INFO L85 PathProgramCache]: Analyzing trace with hash 26934232, now seen corresponding path program 1 times [2024-11-09 02:13:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524687535] [2024-11-09 02:13:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:30,021 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-09 02:13:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:30,025 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-09 02:13:30,026 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-09 02:13:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:30,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:13:30,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:30,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:30,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:30,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524687535] [2024-11-09 02:13:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524687535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:13:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189639409] [2024-11-09 02:13:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:13:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:13:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:30,483 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:30,615 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-09 02:13:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:30,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-09 02:13:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:30,619 INFO L225 Difference]: With dead ends: 162 [2024-11-09 02:13:30,619 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 02:13:30,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:30,622 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:30,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:13:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 02:13:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-09 02:13:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-09 02:13:30,644 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2024-11-09 02:13:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-09 02:13:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-09 02:13:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:13:30,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:30,650 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:30,666 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-09 02:13:30,850 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-09 02:13:30,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:30,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 706992602, now seen corresponding path program 1 times [2024-11-09 02:13:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092866598] [2024-11-09 02:13:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:30,854 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-09 02:13:30,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:30,857 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-09 02:13:30,858 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-09 02:13:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:13:31,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:31,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:13:31,463 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-09 02:13:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 02:13:31,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:31,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:31,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092866598] [2024-11-09 02:13:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092866598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:31,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982424177] [2024-11-09 02:13:31,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:31,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:13:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:13:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:13:31,542 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:13:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:32,698 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2024-11-09 02:13:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:13:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-09 02:13:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:32,703 INFO L225 Difference]: With dead ends: 164 [2024-11-09 02:13:32,704 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 02:13:32,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 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-09 02:13:32,706 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 82 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:32,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 342 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:13:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 02:13:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-09 02:13:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2024-11-09 02:13:32,725 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 114 [2024-11-09 02:13:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:32,725 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2024-11-09 02:13:32,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:13:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2024-11-09 02:13:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:13:32,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:32,730 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:32,743 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-09 02:13:32,930 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-09 02:13:32,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:32,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 184993312, now seen corresponding path program 1 times [2024-11-09 02:13:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192750526] [2024-11-09 02:13:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:32,933 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-09 02:13:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:32,936 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-09 02:13:32,937 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-09 02:13:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 02:13:33,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:34,790 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 15 treesize of output 1 [2024-11-09 02:13:36,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-09 02:13:37,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-09 02:13:38,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2024-11-09 02:13:41,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2024-11-09 02:13:43,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2024-11-09 02:13:44,464 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2024-11-09 02:13:44,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 97 [2024-11-09 02:13:44,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 93 [2024-11-09 02:13:47,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 96 [2024-11-09 02:13:50,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2024-11-09 02:13:51,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 123 [2024-11-09 02:13:51,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:13:51,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 144 treesize of output 80 [2024-11-09 02:13:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 190 proven. 144 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 02:13:51,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:13:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:51,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:51,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192750526] [2024-11-09 02:13:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192750526] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:51,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:13:51,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 25 [2024-11-09 02:13:51,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236183150] [2024-11-09 02:13:51,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:51,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:51,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=513, Unknown=3, NotChecked=0, Total=600 [2024-11-09 02:13:51,840 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:52,592 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2024-11-09 02:13:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:52,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 02:13:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:52,594 INFO L225 Difference]: With dead ends: 191 [2024-11-09 02:13:52,594 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:13:52,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=92, Invalid=607, Unknown=3, NotChecked=0, Total=702 [2024-11-09 02:13:52,596 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:52,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 409 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:13:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:13:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2024-11-09 02:13:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2024-11-09 02:13:52,605 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 116 [2024-11-09 02:13:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:52,605 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2024-11-09 02:13:52,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2024-11-09 02:13:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:13:52,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:52,607 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:52,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 02:13:52,808 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-09 02:13:52,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -277437692, now seen corresponding path program 1 times [2024-11-09 02:13:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098166601] [2024-11-09 02:13:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:52,810 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-09 02:13:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:52,813 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-09 02:13:52,817 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-09 02:13:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:53,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 02:13:53,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:53,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:53,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098166601] [2024-11-09 02:13:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098166601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:53,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:13:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620132463] [2024-11-09 02:13:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:53,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:13:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:13:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:53,102 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:53,117 INFO L93 Difference]: Finished difference Result 162 states and 225 transitions. [2024-11-09 02:13:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:13:53,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-09 02:13:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:53,120 INFO L225 Difference]: With dead ends: 162 [2024-11-09 02:13:53,120 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 02:13:53,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 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-09 02:13:53,122 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 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-09 02:13:53,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 02:13:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 02:13:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-09 02:13:53,135 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 117 [2024-11-09 02:13:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:53,136 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-09 02:13:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-09 02:13:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:13:53,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:53,138 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:53,147 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:13:53,338 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-09 02:13:53,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:53,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2124578663, now seen corresponding path program 1 times [2024-11-09 02:13:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801979613] [2024-11-09 02:13:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:53,340 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-09 02:13:53,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:53,342 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-09 02:13:53,343 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-09 02:14:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:09,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 02:14:09,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:12,613 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 8 treesize of output 1 [2024-11-09 02:14:14,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 61 [2024-11-09 02:14:16,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2024-11-09 02:14:18,032 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-09 02:14:18,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 88 [2024-11-09 02:14:18,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 118 [2024-11-09 02:14:27,902 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification. DAG size of input: 106 DAG size of output: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 02:14:27,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 124 [2024-11-09 02:14:32,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 137 [2024-11-09 02:14:36,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 142 [2024-11-09 02:14:44,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:44,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 352 treesize of output 164 [2024-11-09 02:14:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 131 proven. 105 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-09 02:14:46,644 INFO L311 TraceCheckSpWp]: Computing backward predicates...