./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.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 f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:05:37,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:05:37,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:05:37,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:05:37,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:05:37,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:05:37,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:05:37,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:05:37,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:05:37,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:05:37,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:05:37,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:05:37,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:05:37,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:05:37,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:05:37,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:05:37,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:05:37,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:05:37,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:05:37,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:05:37,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:05:37,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:05:37,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:05:37,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:05:37,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:05:37,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:05:37,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:05:37,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:05:37,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:05:37,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:05:37,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:05:37,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:05:37,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:05:37,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:05:37,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:05:37,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:05:37,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:05:37,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:05:37,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:05:37,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:05:37,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:05:37,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:05:37,145 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 -> f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 [2024-11-20 09:05:37,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:05:37,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:05:37,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:05:37,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:05:37,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:05:37,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2024-11-20 09:05:38,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:05:38,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:05:38,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2024-11-20 09:05:38,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540a41674/3aca6025ed6e45dcbf59b478de7de727/FLAGdd0439533 [2024-11-20 09:05:38,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540a41674/3aca6025ed6e45dcbf59b478de7de727 [2024-11-20 09:05:38,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:05:38,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:05:38,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:05:38,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:05:38,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:05:38,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:05:38" (1/1) ... [2024-11-20 09:05:38,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73eb4aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:38, skipping insertion in model container [2024-11-20 09:05:38,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:05:38" (1/1) ... [2024-11-20 09:05:39,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:05:39,153 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-25.i[917,930] [2024-11-20 09:05:39,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:05:39,222 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:05:39,231 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-25.i[917,930] [2024-11-20 09:05:39,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:05:39,278 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:05:39,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39 WrapperNode [2024-11-20 09:05:39,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:05:39,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:05:39,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:05:39,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:05:39,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,343 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2024-11-20 09:05:39,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:05:39,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:05:39,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:05:39,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:05:39,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,370 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:05:39,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:05:39,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:05:39,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:05:39,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:05:39,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (1/1) ... [2024-11-20 09:05:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:05:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:05:39,448 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-20 09:05:39,451 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-20 09:05:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:05:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:05:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:05:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:05:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:05:39,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:05:39,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:05:40,218 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-20 09:05:40,218 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:05:40,236 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:05:40,236 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:05:40,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:40 BoogieIcfgContainer [2024-11-20 09:05:40,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:05:40,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:05:40,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:05:40,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:05:40,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:05:38" (1/3) ... [2024-11-20 09:05:40,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42615a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:05:40, skipping insertion in model container [2024-11-20 09:05:40,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:39" (2/3) ... [2024-11-20 09:05:40,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42615a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:05:40, skipping insertion in model container [2024-11-20 09:05:40,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:40" (3/3) ... [2024-11-20 09:05:40,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-25.i [2024-11-20 09:05:40,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:05:40,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:05:40,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:05:40,317 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;@42e9db83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:05:40,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:05:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 09:05:40,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:40,347 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:40,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:40,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1046836043, now seen corresponding path program 1 times [2024-11-20 09:05:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236148378] [2024-11-20 09:05:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:40,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:40,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236148378] [2024-11-20 09:05:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236148378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:05:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182651237] [2024-11-20 09:05:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:40,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:05:40,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:40,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:05:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:05:40,818 INFO L87 Difference]: Start difference. First operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 09:05:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:40,844 INFO L93 Difference]: Finished difference Result 241 states and 378 transitions. [2024-11-20 09:05:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:05:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-11-20 09:05:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:40,851 INFO L225 Difference]: With dead ends: 241 [2024-11-20 09:05:40,852 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 09:05:40,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-20 09:05:40,857 INFO L432 NwaCegarLoop]: 176 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, 176 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-20 09:05:40,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:05:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 09:05:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 09:05:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-20 09:05:40,891 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2024-11-20 09:05:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:40,892 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-20 09:05:40,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 09:05:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-20 09:05:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 09:05:40,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:40,895 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:05:40,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -437863509, now seen corresponding path program 1 times [2024-11-20 09:05:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61431874] [2024-11-20 09:05:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:41,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61431874] [2024-11-20 09:05:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61431874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:05:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431391015] [2024-11-20 09:05:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:41,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:05:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:05:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:05:41,795 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:42,093 INFO L93 Difference]: Finished difference Result 241 states and 355 transitions. [2024-11-20 09:05:42,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:05:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-20 09:05:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:42,095 INFO L225 Difference]: With dead ends: 241 [2024-11-20 09:05:42,095 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 09:05:42,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:05:42,097 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 135 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:42,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 413 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:05:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 09:05:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-20 09:05:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-20 09:05:42,111 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 144 [2024-11-20 09:05:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:42,115 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-20 09:05:42,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-20 09:05:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 09:05:42,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:42,118 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:42,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:05:42,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1659383948, now seen corresponding path program 1 times [2024-11-20 09:05:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782053521] [2024-11-20 09:05:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782053521] [2024-11-20 09:05:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782053521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:05:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17821543] [2024-11-20 09:05:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:05:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:05:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:05:44,706 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 09:05:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:45,663 INFO L93 Difference]: Finished difference Result 295 states and 432 transitions. [2024-11-20 09:05:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:05:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2024-11-20 09:05:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:45,667 INFO L225 Difference]: With dead ends: 295 [2024-11-20 09:05:45,669 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 09:05:45,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:05:45,671 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 458 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:45,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 758 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:05:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 09:05:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2024-11-20 09:05:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 116 states have internal predecessors, (163), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-20 09:05:45,696 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 144 [2024-11-20 09:05:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:45,696 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-20 09:05:45,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 09:05:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-20 09:05:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 09:05:45,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:45,698 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:45,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:05:45,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 254005952, now seen corresponding path program 1 times [2024-11-20 09:05:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957830230] [2024-11-20 09:05:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:46,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957830230] [2024-11-20 09:05:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957830230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:46,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:05:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407971412] [2024-11-20 09:05:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:46,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:05:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:05:46,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:05:46,830 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:05:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:47,404 INFO L93 Difference]: Finished difference Result 325 states and 477 transitions. [2024-11-20 09:05:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:05:47,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2024-11-20 09:05:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:47,406 INFO L225 Difference]: With dead ends: 325 [2024-11-20 09:05:47,407 INFO L226 Difference]: Without dead ends: 192 [2024-11-20 09:05:47,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:05:47,408 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 361 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:47,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 592 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:05:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-20 09:05:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 152. [2024-11-20 09:05:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.4166666666666667) internal successors, (187), 132 states have internal predecessors, (187), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 223 transitions. [2024-11-20 09:05:47,430 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 223 transitions. Word has length 145 [2024-11-20 09:05:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:47,431 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 223 transitions. [2024-11-20 09:05:47,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:05:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 223 transitions. [2024-11-20 09:05:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 09:05:47,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:47,434 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:05:47,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:47,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash -765919482, now seen corresponding path program 1 times [2024-11-20 09:05:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731095107] [2024-11-20 09:05:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731095107] [2024-11-20 09:05:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731095107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:05:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462037311] [2024-11-20 09:05:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:47,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:05:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:05:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:05:47,592 INFO L87 Difference]: Start difference. First operand 152 states and 223 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:47,635 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2024-11-20 09:05:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:05:47,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-20 09:05:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:47,637 INFO L225 Difference]: With dead ends: 304 [2024-11-20 09:05:47,638 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 09:05:47,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:05:47,639 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:47,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:05:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 09:05:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-11-20 09:05:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.413533834586466) internal successors, (188), 133 states have internal predecessors, (188), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 224 transitions. [2024-11-20 09:05:47,660 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 224 transitions. Word has length 146 [2024-11-20 09:05:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:47,661 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 224 transitions. [2024-11-20 09:05:47,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2024-11-20 09:05:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 09:05:47,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:47,664 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:05:47,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1385794405, now seen corresponding path program 1 times [2024-11-20 09:05:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392874760] [2024-11-20 09:05:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392874760] [2024-11-20 09:05:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392874760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:48,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:48,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:05:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279747533] [2024-11-20 09:05:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:48,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:05:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:48,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:05:48,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:05:48,931 INFO L87 Difference]: Start difference. First operand 153 states and 224 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:05:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:49,782 INFO L93 Difference]: Finished difference Result 346 states and 505 transitions. [2024-11-20 09:05:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:05:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2024-11-20 09:05:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:49,785 INFO L225 Difference]: With dead ends: 346 [2024-11-20 09:05:49,785 INFO L226 Difference]: Without dead ends: 196 [2024-11-20 09:05:49,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:05:49,787 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 307 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:49,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 815 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:05:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-20 09:05:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 137. [2024-11-20 09:05:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 199 transitions. [2024-11-20 09:05:49,802 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 199 transitions. Word has length 147 [2024-11-20 09:05:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 199 transitions. [2024-11-20 09:05:49,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:05:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 199 transitions. [2024-11-20 09:05:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 09:05:49,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:49,804 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:49,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:05:49,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:49,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 804611275, now seen corresponding path program 1 times [2024-11-20 09:05:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587092841] [2024-11-20 09:05:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587092841] [2024-11-20 09:05:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587092841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:50,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:05:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859970885] [2024-11-20 09:05:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:05:50,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:05:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:05:50,975 INFO L87 Difference]: Start difference. First operand 137 states and 199 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:05:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:51,816 INFO L93 Difference]: Finished difference Result 307 states and 445 transitions. [2024-11-20 09:05:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:05:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2024-11-20 09:05:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:51,818 INFO L225 Difference]: With dead ends: 307 [2024-11-20 09:05:51,818 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 09:05:51,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:05:51,819 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 545 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:51,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 591 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:05:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 09:05:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2024-11-20 09:05:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2024-11-20 09:05:51,831 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 148 [2024-11-20 09:05:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:51,831 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2024-11-20 09:05:51,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:05:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2024-11-20 09:05:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 09:05:51,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:51,833 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:51,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:05:51,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1438403970, now seen corresponding path program 1 times [2024-11-20 09:05:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983727420] [2024-11-20 09:05:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:52,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983727420] [2024-11-20 09:05:52,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983727420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:52,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:52,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:05:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718161504] [2024-11-20 09:05:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:52,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:05:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:52,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:05:52,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:05:52,700 INFO L87 Difference]: Start difference. First operand 137 states and 198 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:53,024 INFO L93 Difference]: Finished difference Result 305 states and 440 transitions. [2024-11-20 09:05:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:05:53,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-20 09:05:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:53,027 INFO L225 Difference]: With dead ends: 305 [2024-11-20 09:05:53,027 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 09:05:53,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:05:53,027 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 296 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:53,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 414 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:05:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 09:05:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2024-11-20 09:05:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:05:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2024-11-20 09:05:53,039 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 148 [2024-11-20 09:05:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:53,040 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2024-11-20 09:05:53,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2024-11-20 09:05:53,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 09:05:53,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:53,041 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:53,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:05:53,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1739038669, now seen corresponding path program 1 times [2024-11-20 09:05:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554335403] [2024-11-20 09:05:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 09:05:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:53,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554335403] [2024-11-20 09:05:53,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554335403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:05:53,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281391724] [2024-11-20 09:05:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:05:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:05:53,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:05:53,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 09:05:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:53,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 09:05:53,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:05:54,661 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-20 09:05:54,828 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-20 09:05:54,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-11-20 09:05:54,857 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-20 09:05:54,857 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 28 treesize of output 12 [2024-11-20 09:05:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 09:05:54,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:05:55,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-20 09:05:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 09:05:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281391724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:05:55,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:05:55,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2024-11-20 09:05:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647455664] [2024-11-20 09:05:55,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:05:55,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 09:05:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 09:05:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-20 09:05:55,212 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 9 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 9 states have call successors, (54) [2024-11-20 09:05:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:56,219 INFO L93 Difference]: Finished difference Result 340 states and 489 transitions. [2024-11-20 09:05:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 09:05:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 9 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 9 states have call successors, (54) Word has length 148 [2024-11-20 09:05:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:56,222 INFO L225 Difference]: With dead ends: 340 [2024-11-20 09:05:56,222 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 09:05:56,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 09:05:56,223 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 363 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:56,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 701 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:05:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 09:05:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 189. [2024-11-20 09:05:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 153 states have internal predecessors, (203), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:05:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2024-11-20 09:05:56,253 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 148 [2024-11-20 09:05:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:56,254 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2024-11-20 09:05:56,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 9 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 9 states have call successors, (54) [2024-11-20 09:05:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2024-11-20 09:05:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 09:05:56,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:56,255 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:56,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:05:56,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:05:56,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:56,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -361307625, now seen corresponding path program 1 times [2024-11-20 09:05:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:56,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898768257] [2024-11-20 09:05:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:05:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:05:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:05:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:05:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:05:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:05:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:05:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:05:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:05:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:05:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 09:05:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:57,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898768257] [2024-11-20 09:05:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898768257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:57,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:57,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 09:05:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846704427] [2024-11-20 09:05:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:05:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:05:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:05:57,437 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:58,180 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2024-11-20 09:05:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:05:58,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-20 09:05:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:58,183 INFO L225 Difference]: With dead ends: 386 [2024-11-20 09:05:58,183 INFO L226 Difference]: Without dead ends: 243 [2024-11-20 09:05:58,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:05:58,184 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 253 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:58,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 523 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:05:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-20 09:05:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 206. [2024-11-20 09:05:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 169 states have (on average 1.349112426035503) internal successors, (228), 170 states have internal predecessors, (228), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:05:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2024-11-20 09:05:58,208 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 149 [2024-11-20 09:05:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:58,209 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2024-11-20 09:05:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 09:05:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2024-11-20 09:05:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 09:05:58,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:58,210 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:05:58,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:05:58,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1058095520, now seen corresponding path program 1 times [2024-11-20 09:05:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417282832] [2024-11-20 09:05:58,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:05:58,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:05:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:05:58,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:05:58,441 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:05:58,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:05:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:05:58,446 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:58,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:05:58,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:05:58 BoogieIcfgContainer [2024-11-20 09:05:58,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:05:58,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:05:58,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:05:58,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:05:58,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:40" (3/4) ... [2024-11-20 09:05:58,574 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:05:58,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:05:58,576 INFO L158 Benchmark]: Toolchain (without parser) took 19588.60ms. Allocated memory was 155.2MB in the beginning and 484.4MB in the end (delta: 329.3MB). Free memory was 85.8MB in the beginning and 249.6MB in the end (delta: -163.9MB). Peak memory consumption was 167.4MB. Max. memory is 16.1GB. [2024-11-20 09:05:58,576 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:05:58,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.08ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 67.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 09:05:58,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.86ms. Allocated memory is still 155.2MB. Free memory was 67.9MB in the beginning and 63.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:05:58,577 INFO L158 Benchmark]: Boogie Preprocessor took 55.65ms. Allocated memory is still 155.2MB. Free memory was 63.8MB in the beginning and 60.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:05:58,577 INFO L158 Benchmark]: RCFGBuilder took 836.51ms. Allocated memory is still 155.2MB. Free memory was 60.1MB in the beginning and 89.5MB in the end (delta: -29.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 09:05:58,577 INFO L158 Benchmark]: TraceAbstraction took 18330.67ms. Allocated memory was 155.2MB in the beginning and 484.4MB in the end (delta: 329.3MB). Free memory was 88.8MB in the beginning and 249.6MB in the end (delta: -160.8MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. [2024-11-20 09:05:58,577 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 484.4MB. Free memory is still 249.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:05:58,578 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 117.4MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.08ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 67.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.86ms. Allocated memory is still 155.2MB. Free memory was 67.9MB in the beginning and 63.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.65ms. Allocated memory is still 155.2MB. Free memory was 63.8MB in the beginning and 60.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 836.51ms. Allocated memory is still 155.2MB. Free memory was 60.1MB in the beginning and 89.5MB in the end (delta: -29.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18330.67ms. Allocated memory was 155.2MB in the beginning and 484.4MB in the end (delta: 329.3MB). Free memory was 88.8MB in the beginning and 249.6MB in the end (delta: -160.8MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 484.4MB. Free memory is still 249.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 256, 0, 10, 500, 0, 1509114200, 10, 128.9, 63.363, 4.575, 25.5, 1, 0, 1 }; [L55] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L58] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L67] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L68] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=0] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L107] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L110] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L113] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L114] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L116] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L117] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L118] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L119] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L121] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L122] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L123] EXPR WrapperStruct00.var_1_9 [L123] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L123] EXPR WrapperStruct00.var_1_9 [L123] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L123] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L123] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L124] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_10 [L125] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_10 [L125] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L125] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L128] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L144] RET updateVariables() [L145] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L72] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer)) != (*(WrapperStruct00_var_1_10_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L79] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L81] unsigned short int stepLocal_0 = (*(WrapperStruct00_var_1_3_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1, stepLocal_0=65538] [L82] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1, stepLocal_0=65538] [L83] COND FALSE !(stepLocal_0 <= (*(WrapperStruct00_var_1_4_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L89] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_1_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1, stepLocal_1=256] [L90] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) >= stepLocal_1) [L93] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L93] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L93] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L93] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L95] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] EXPR ((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] EXPR ((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L95] EXPR ((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] COND TRUE (*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer))))) [L96] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L96] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_10_Pointer)) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer)))) [L136] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) [L136] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) [L136] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L136] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L136] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_10_Pointer)))) : ((! ((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_10_Pointer)))) : ((! ((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_9_Pointer)))) : 1))) && (((*(WrapperStruct00_var_1_9_Pointer)) != (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136-L137] return ((((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_10_Pointer)))) : ((! ((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_9_Pointer)))) : 1))) && (((*(WrapperStruct00_var_1_9_Pointer)) != (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2719 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2718 mSDsluCounter, 5665 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4148 mSDsCounter, 328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4273 IncrementalHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 328 mSolverCounterUnsat, 1517 mSDtfsCounter, 4273 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 680 SyntacticMatches, 12 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=10, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 261 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1762 NumberOfCodeBlocks, 1762 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 15933 SizeOfPredicates, 9 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 7207/7344 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-20 09:05:58,607 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.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 f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:06:00,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:06:00,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:06:00,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:06:00,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:06:00,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:06:00,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:06:00,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:06:00,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:06:00,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:06:00,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:06:00,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:06:00,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:06:00,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:06:00,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:06:00,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:06:00,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:06:00,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:06:00,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:06:00,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:06:00,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:06:00,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:06:00,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:06:00,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:06:00,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:06:00,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:06:00,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:06:00,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:06:00,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:06:00,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:06:00,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:06:00,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:06:00,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:06:00,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:06:00,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:00,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:06:00,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:06:00,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:06:00,718 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:06:00,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:06:00,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:06:00,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:06:00,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:06:00,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:06:00,719 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 -> f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 [2024-11-20 09:06:01,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:06:01,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:06:01,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:06:01,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:06:01,030 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:06:01,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2024-11-20 09:06:02,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:06:02,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:06:02,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2024-11-20 09:06:02,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50735e26e/f5016065aab34aaf9d7330673505f518/FLAGa26782bf8 [2024-11-20 09:06:02,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50735e26e/f5016065aab34aaf9d7330673505f518 [2024-11-20 09:06:02,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:06:02,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:06:02,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:02,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:06:02,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:06:02,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:02,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793f7b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02, skipping insertion in model container [2024-11-20 09:06:02,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:02,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:06:02,802 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-25.i[917,930] [2024-11-20 09:06:02,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:02,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:06:02,898 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-25.i[917,930] [2024-11-20 09:06:02,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:02,964 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:06:02,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02 WrapperNode [2024-11-20 09:06:02,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:02,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:02,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:06:02,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:06:02,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:02,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,014 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 567 [2024-11-20 09:06:03,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:03,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:06:03,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:06:03,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:06:03,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,054 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-20 09:06:03,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:06:03,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:06:03,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:06:03,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:06:03,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (1/1) ... [2024-11-20 09:06:03,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:06:03,121 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-20 09:06:03,124 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-20 09:06:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:06:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:06:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:06:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:06:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:06:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 09:06:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:06:03,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:06:03,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:06:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:06:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 09:06:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 09:06:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:06:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:06:03,303 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:06:03,305 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:06:04,212 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-20 09:06:04,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:06:04,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:06:04,229 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:06:04,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:04 BoogieIcfgContainer [2024-11-20 09:06:04,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:06:04,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:06:04,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:06:04,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:06:04,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:06:02" (1/3) ... [2024-11-20 09:06:04,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ab24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:04, skipping insertion in model container [2024-11-20 09:06:04,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:02" (2/3) ... [2024-11-20 09:06:04,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ab24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:04, skipping insertion in model container [2024-11-20 09:06:04,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:04" (3/3) ... [2024-11-20 09:06:04,237 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-25.i [2024-11-20 09:06:04,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:06:04,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:06:04,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:06:04,316 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;@63d12fa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:06:04,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:06:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:06:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 09:06:04,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:04,332 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:04,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1167224636, now seen corresponding path program 1 times [2024-11-20 09:06:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401515915] [2024-11-20 09:06:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:04,351 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-20 09:06:04,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:04,353 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-20 09:06:04,354 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-20 09:06:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:04,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:06:04,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-20 09:06:04,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:06:04,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401515915] [2024-11-20 09:06:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401515915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:06:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836967073] [2024-11-20 09:06:04,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:04,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:06:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:06:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:06:04,797 INFO L87 Difference]: Start difference. First operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 09:06:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:04,832 INFO L93 Difference]: Finished difference Result 241 states and 378 transitions. [2024-11-20 09:06:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:06:04,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-11-20 09:06:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:04,842 INFO L225 Difference]: With dead ends: 241 [2024-11-20 09:06:04,842 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 09:06:04,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-20 09:06:04,847 INFO L432 NwaCegarLoop]: 176 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, 176 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-20 09:06:04,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 09:06:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 09:06:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 09:06:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-20 09:06:04,887 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2024-11-20 09:06:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:04,888 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-20 09:06:04,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 09:06:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-20 09:06:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 09:06:04,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:04,890 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:04,900 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-20 09:06:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:06:05,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1643043108, now seen corresponding path program 1 times [2024-11-20 09:06:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945874201] [2024-11-20 09:06:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:05,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 09:06:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:05,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 09:06:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 09:06:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:05,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 09:06:05,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:10,514 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-20 09:06:10,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-20 09:06:10,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-20 09:06:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 68 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 09:06:10,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:06:47,091 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-11-20 09:06:47,092 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 34 treesize of output 27 [2024-11-20 09:06:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-20 09:06:47,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:47,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945874201] [2024-11-20 09:06:47,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945874201] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 09:06:47,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:06:47,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2024-11-20 09:06:47,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385697483] [2024-11-20 09:06:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:06:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:06:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=395, Unknown=9, NotChecked=0, Total=506 [2024-11-20 09:06:47,352 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:07:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:01,232 INFO L93 Difference]: Finished difference Result 298 states and 437 transitions. [2024-11-20 09:07:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:07:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2024-11-20 09:07:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:01,241 INFO L225 Difference]: With dead ends: 298 [2024-11-20 09:07:01,243 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 09:07:01,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=170, Invalid=630, Unknown=12, NotChecked=0, Total=812 [2024-11-20 09:07:01,245 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 226 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:01,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 587 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 09:07:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 09:07:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2024-11-20 09:07:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 133 states have internal predecessors, (178), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:07:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 246 transitions. [2024-11-20 09:07:01,280 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 246 transitions. Word has length 144 [2024-11-20 09:07:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:01,281 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 246 transitions. [2024-11-20 09:07:01,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 09:07:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2024-11-20 09:07:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 09:07:01,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:01,283 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:07:01,296 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:07:01,484 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-20 09:07:01,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:01,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1671490847, now seen corresponding path program 1 times [2024-11-20 09:07:01,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:01,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181731149] [2024-11-20 09:07:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:01,486 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-20 09:07:01,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:01,488 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-20 09:07:01,489 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-20 09:07:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:01,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 09:07:01,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:05,110 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 36 treesize of output 27