./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-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-1.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 327e35b6dc29e8a86fe3d15e0eda0c207d980f8afd728e05834a6653fd2adb64 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:54:51,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:54:51,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:54:51,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:54:51,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:54:51,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:54:51,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:54:51,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:54:51,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:54:51,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:54:51,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:54:51,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:54:51,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:54:51,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:54:51,452 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:54:51,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:54:51,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:54:51,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:54:51,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:54:51,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:54:51,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:54:51,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:54:51,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:54:51,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:54:51,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:54:51,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:54:51,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:54:51,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:54:51,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:54:51,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:54:51,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:54:51,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:54:51,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:51,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:54:51,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:54:51,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:54:51,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:54:51,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:54:51,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:54:51,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:54:51,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:54:51,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:54:51,464 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 -> 327e35b6dc29e8a86fe3d15e0eda0c207d980f8afd728e05834a6653fd2adb64 [2024-10-24 11:54:51,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:54:51,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:54:51,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:54:51,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:54:51,826 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:54:51,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-1.i [2024-10-24 11:54:53,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:54:53,529 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:54:53,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-1.i [2024-10-24 11:54:53,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d080baaef/5d8b87c0b55b4dbd92352b0b1b8e5899/FLAGe49556687 [2024-10-24 11:54:53,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d080baaef/5d8b87c0b55b4dbd92352b0b1b8e5899 [2024-10-24 11:54:53,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:54:53,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:54:53,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:53,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:54:53,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:54:53,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:53" (1/1) ... [2024-10-24 11:54:53,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1293e543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:53, skipping insertion in model container [2024-10-24 11:54:53,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:53" (1/1) ... [2024-10-24 11:54:53,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:54:54,105 WARN L248 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-1.i[916,929] [2024-10-24 11:54:54,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:54,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:54:54,220 WARN L248 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-1.i[916,929] [2024-10-24 11:54:54,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:54,298 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:54:54,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54 WrapperNode [2024-10-24 11:54:54,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:54,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:54,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:54:54,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:54:54,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,379 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-10-24 11:54:54,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:54,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:54:54,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:54:54,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:54:54,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,426 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-24 11:54:54,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:54:54,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:54:54,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:54:54,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:54:54,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (1/1) ... [2024-10-24 11:54:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:54:54,498 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-10-24 11:54:54,501 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-10-24 11:54:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:54:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:54:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:54:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:54:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:54:54,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:54:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:54:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:54:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:54:54,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:54:54,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:54:54,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:54:55,265 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-24 11:54:55,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:54:55,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:54:55,314 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:54:55,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:55 BoogieIcfgContainer [2024-10-24 11:54:55,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:54:55,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:54:55,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:54:55,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:54:55,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:54:53" (1/3) ... [2024-10-24 11:54:55,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b186bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:54:55, skipping insertion in model container [2024-10-24 11:54:55,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:54" (2/3) ... [2024-10-24 11:54:55,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b186bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:54:55, skipping insertion in model container [2024-10-24 11:54:55,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:55" (3/3) ... [2024-10-24 11:54:55,326 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-1.i [2024-10-24 11:54:55,341 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:54:55,341 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:54:55,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:54:55,401 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;@1c71e1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:54:55,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:54:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:54:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:54:55,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:55,420 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:55,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:55,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1842290435, now seen corresponding path program 1 times [2024-10-24 11:54:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063930922] [2024-10-24 11:54:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:55,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:54:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:54:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:54:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:54:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:54:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:54:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:54:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:54:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:54:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:54:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:54:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:54:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:54:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:54:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:54:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:55,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063930922] [2024-10-24 11:54:55,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063930922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:55,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:55,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:54:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578409332] [2024-10-24 11:54:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:55,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:54:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:54:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:54:55,917 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:54:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:55,966 INFO L93 Difference]: Finished difference Result 199 states and 314 transitions. [2024-10-24 11:54:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:54:55,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-24 11:54:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:55,979 INFO L225 Difference]: With dead ends: 199 [2024-10-24 11:54:55,979 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 11:54:55,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:54:55,987 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:55,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 11:54:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 11:54:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:54:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2024-10-24 11:54:56,046 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 119 [2024-10-24 11:54:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:56,047 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2024-10-24 11:54:56,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:54:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2024-10-24 11:54:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:54:56,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:56,052 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:56,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:54:56,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:56,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:56,053 INFO L85 PathProgramCache]: Analyzing trace with hash -604465371, now seen corresponding path program 1 times [2024-10-24 11:54:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356060490] [2024-10-24 11:54:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:54:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:54:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:54:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:54:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:54:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:54:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:54:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:54:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:54:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:54:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:54:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:54:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:54:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:54:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:54:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:56,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356060490] [2024-10-24 11:54:56,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356060490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855837111] [2024-10-24 11:54:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:56,480 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:54:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:56,537 INFO L93 Difference]: Finished difference Result 200 states and 295 transitions. [2024-10-24 11:54:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-24 11:54:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:56,541 INFO L225 Difference]: With dead ends: 200 [2024-10-24 11:54:56,543 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 11:54:56,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:56,545 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:56,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 11:54:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-24 11:54:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:54:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-10-24 11:54:56,566 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 119 [2024-10-24 11:54:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:56,568 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-10-24 11:54:56,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:54:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-10-24 11:54:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:54:56,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:56,571 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:56,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:54:56,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:56,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash -547207069, now seen corresponding path program 1 times [2024-10-24 11:54:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:56,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973276568] [2024-10-24 11:54:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:54:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:54:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:54:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:54:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:54:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:54:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:54:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:54:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:54:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:54:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:54:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:54:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:54:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:54:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:54:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973276568] [2024-10-24 11:54:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973276568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859353877] [2024-10-24 11:54:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:56,858 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:54:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:56,907 INFO L93 Difference]: Finished difference Result 204 states and 299 transitions. [2024-10-24 11:54:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-24 11:54:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:56,913 INFO L225 Difference]: With dead ends: 204 [2024-10-24 11:54:56,913 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:54:56,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:56,915 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:56,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:54:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-24 11:54:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:54:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-24 11:54:56,934 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 119 [2024-10-24 11:54:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:56,935 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-24 11:54:56,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:54:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-24 11:54:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:54:56,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:56,941 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:56,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:54:56,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:56,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash -547147487, now seen corresponding path program 1 times [2024-10-24 11:54:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735697222] [2024-10-24 11:54:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:54:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:54:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:54:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:54:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:54:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:54:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:54:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:54:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:54:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:54:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:54:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:54:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:54:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:54:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:54:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735697222] [2024-10-24 11:54:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735697222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:54:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833510163] [2024-10-24 11:54:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:54:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:54:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:54:57,861 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:54:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:58,277 INFO L93 Difference]: Finished difference Result 252 states and 366 transitions. [2024-10-24 11:54:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:54:58,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-24 11:54:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:58,280 INFO L225 Difference]: With dead ends: 252 [2024-10-24 11:54:58,280 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 11:54:58,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:54:58,282 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 271 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:58,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 348 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:54:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 11:54:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2024-10-24 11:54:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:54:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-24 11:54:58,312 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 119 [2024-10-24 11:54:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:58,313 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-24 11:54:58,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:54:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-10-24 11:54:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:54:58,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:58,317 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:54:58,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:54:58,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1133953501, now seen corresponding path program 1 times [2024-10-24 11:54:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:54:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666662049] [2024-10-24 11:54:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:54:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:54:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:54:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:54:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:54:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:54:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:54:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:54:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:54:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:54:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:54:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:54:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:54:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:54:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:54:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:54:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:54:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666662049] [2024-10-24 11:54:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666662049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:59,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:59,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:54:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361616376] [2024-10-24 11:54:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:54:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:54:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:54:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:54:59,700 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:55:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:55:00,243 INFO L93 Difference]: Finished difference Result 255 states and 372 transitions. [2024-10-24 11:55:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:55:00,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-10-24 11:55:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:55:00,247 INFO L225 Difference]: With dead ends: 255 [2024-10-24 11:55:00,247 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 11:55:00,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:55:00,252 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 166 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:55:00,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 344 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:55:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 11:55:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-10-24 11:55:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 121 states have internal predecessors, (169), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:55:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2024-10-24 11:55:00,279 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 119 [2024-10-24 11:55:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:55:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2024-10-24 11:55:00,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:55:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2024-10-24 11:55:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:55:00,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:55:00,282 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:55:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:55:00,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:55:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:55:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1355575461, now seen corresponding path program 1 times [2024-10-24 11:55:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:55:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448218366] [2024-10-24 11:55:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:55:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:55:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:55:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:55:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:55:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:55:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:55:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:55:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:55:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:55:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:55:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:55:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:55:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:55:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:55:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:55:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:55:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448218366] [2024-10-24 11:55:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448218366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:55:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085892108] [2024-10-24 11:55:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:55:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:55:01,817 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-10-24 11:55:01,820 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-10-24 11:55:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:02,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 11:55:02,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:55:03,667 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-10-24 11:55:04,276 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 23 treesize of output 11 [2024-10-24 11:55:04,598 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 23 treesize of output 11 [2024-10-24 11:55:05,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:55:05,094 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 23 treesize of output 11 [2024-10-24 11:55:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:55:05,176 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-10-24 11:55:05,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2024-10-24 11:55:05,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:55:05,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:55:05,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:55:05,298 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-10-24 11:55:05,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 50 [2024-10-24 11:55:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:55:05,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-24 11:55:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 141 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-24 11:55:05,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:55:21,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_342 Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.base Int) (~WrapperStruct00_var_1_13_Pointer~0.offset Int) (~WrapperStruct00_var_1_13_Pointer~0.base Int)) (< 0 (+ (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_342)))) (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (mod (select (select .cse1 ~WrapperStruct00_var_1_13_Pointer~0.base) ~WrapperStruct00_var_1_13_Pointer~0.offset) 256)))))) (store .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset (+ (select (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) (select (select .cse0 ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) (- 4))))) c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) 1))) is different from false [2024-10-24 11:55:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085892108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:55:21,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:55:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-10-24 11:55:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628925719] [2024-10-24 11:55:21,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:55:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:55:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:55:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:55:21,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=442, Unknown=3, NotChecked=44, Total=600 [2024-10-24 11:55:21,824 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 22 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 9 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2024-10-24 11:55:26,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:31,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:35,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:39,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:43,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:47,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:51,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:55,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:55:59,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:56:03,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:56:07,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-24 11:56:11,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-24 11:56:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:11,676 INFO L93 Difference]: Finished difference Result 278 states and 395 transitions. [2024-10-24 11:56:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:56:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 9 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) Word has length 119 [2024-10-24 11:56:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:11,679 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:56:11,679 INFO L226 Difference]: Without dead ends: 164 [2024-10-24 11:56:11,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=298, Invalid=825, Unknown=3, NotChecked=64, Total=1190 [2024-10-24 11:56:11,681 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 375 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 178 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:11,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 588 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 855 Invalid, 12 Unknown, 0 Unchecked, 49.0s Time] [2024-10-24 11:56:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-24 11:56:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-10-24 11:56:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 131 states have internal predecessors, (177), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:56:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2024-10-24 11:56:11,710 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 119 [2024-10-24 11:56:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:11,710 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2024-10-24 11:56:11,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 9 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2024-10-24 11:56:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2024-10-24 11:56:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:56:11,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:11,712 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:56:11,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:56:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 11:56:11,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -232772441, now seen corresponding path program 1 times [2024-10-24 11:56:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936980628] [2024-10-24 11:56:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:56:12,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:56:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:56:12,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:56:12,155 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:56:12,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:56:12,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:56:12,161 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:56:12,309 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:56:12,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:56:12 BoogieIcfgContainer [2024-10-24 11:56:12,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:56:12,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:56:12,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:56:12,313 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:56:12,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:55" (3/4) ... [2024-10-24 11:56:12,316 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:56:12,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:56:12,318 INFO L158 Benchmark]: Toolchain (without parser) took 78407.60ms. Allocated memory was 146.8MB in the beginning and 337.6MB in the end (delta: 190.8MB). Free memory was 109.3MB in the beginning and 183.9MB in the end (delta: -74.6MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2024-10-24 11:56:12,318 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:56:12,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.25ms. Allocated memory is still 146.8MB. Free memory was 108.7MB in the beginning and 92.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:56:12,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.75ms. Allocated memory is still 146.8MB. Free memory was 92.0MB in the beginning and 88.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:56:12,319 INFO L158 Benchmark]: Boogie Preprocessor took 79.30ms. Allocated memory is still 146.8MB. Free memory was 88.4MB in the beginning and 84.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:56:12,319 INFO L158 Benchmark]: RCFGBuilder took 854.78ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 79.7MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 11:56:12,320 INFO L158 Benchmark]: TraceAbstraction took 76996.02ms. Allocated memory was 146.8MB in the beginning and 337.6MB in the end (delta: 190.8MB). Free memory was 79.7MB in the beginning and 183.9MB in the end (delta: -104.2MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-10-24 11:56:12,320 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 337.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:56:12,322 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.19ms. Allocated memory is still 146.8MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.25ms. Allocated memory is still 146.8MB. Free memory was 108.7MB in the beginning and 92.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.75ms. Allocated memory is still 146.8MB. Free memory was 92.0MB in the beginning and 88.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.30ms. Allocated memory is still 146.8MB. Free memory was 88.4MB in the beginning and 84.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 854.78ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 79.7MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 76996.02ms. Allocated memory was 146.8MB in the beginning and 337.6MB in the end (delta: 190.8MB). Free memory was 79.7MB in the beginning and 183.9MB in the end (delta: -104.2MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 337.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L53] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L54] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L55] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L56] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] signed long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L62] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L63] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L64] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] signed short int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] unsigned long int last_1_WrapperStruct00_var_1_12 = 16; [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_12 [L125] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L135] RET updateLastVariables() [L136] CALL updateVariables() [L101] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_2 [L102] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_2 [L102] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L103] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_3 [L104] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_3 [L104] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L110] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_long() [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L119] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L120] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L121] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L122] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_13 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_13 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L136] RET updateVariables() [L137] CALL step() [L70] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L70] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) [L73] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L73] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L76] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L79] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_7_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L81] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer)) || stepLocal_0) [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L84] (*(WrapperStruct00_var_1_6_Pointer)) = (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4) [L86] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L86] signed long int stepLocal_3 = (*(WrapperStruct00_var_1_11_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L87] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer)); [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L88] EXPR (*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_2=1, stepLocal_3=0] [L88] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer)); [L89] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L89] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_1=0, stepLocal_2=1, stepLocal_3=0] [L89] COND FALSE !(stepLocal_1 != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) [L98] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L98] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L128] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer))))) [L128] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) [L128] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L128] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L128] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L128-L129] return ((((((*(WrapperStruct00_var_1_2_Pointer)) <= (- (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_4_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_10_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) - 4))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) << (*(WrapperStruct00_var_1_16_Pointer))) != (((((*(WrapperStruct00_var_1_10_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) % (*(WrapperStruct00_var_1_13_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) > (last_1_WrapperStruct00_var_1_12 * (*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_13_Pointer)))) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_13_Pointer={4:34}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:17}, WrapperStruct00_var_1_7_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.8s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 819 SdHoareTripleChecker+Valid, 49.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 814 mSDsluCounter, 2243 SdHoareTripleChecker+Invalid, 49.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1552 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1529 IncrementalHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 691 mSDtfsCounter, 1529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 826 ConstructedInterpolants, 4 QuantifiedInterpolants, 6959 SizeOfPredicates, 17 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 2389/2548 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-10-24 11:56:12,550 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-24 11:56:12,590 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 137 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-1.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 327e35b6dc29e8a86fe3d15e0eda0c207d980f8afd728e05834a6653fd2adb64 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:56:14,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:56:14,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:56:14,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:56:14,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:56:14,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:56:14,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:56:14,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:56:14,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:56:14,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:56:14,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:56:14,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:56:14,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:56:14,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:56:14,838 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:56:14,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:56:14,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:56:14,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:56:14,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:56:14,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:56:14,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:56:14,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:56:14,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:56:14,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:56:14,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:56:14,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:56:14,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:56:14,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:56:14,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:56:14,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:56:14,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:56:14,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:56:14,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:56:14,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:56:14,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:56:14,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:56:14,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:56:14,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:56:14,849 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:56:14,849 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:56:14,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:56:14,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:56:14,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:56:14,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:56:14,851 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:56:14,851 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 -> 327e35b6dc29e8a86fe3d15e0eda0c207d980f8afd728e05834a6653fd2adb64 [2024-10-24 11:56:15,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:56:15,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:56:15,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:56:15,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:56:15,231 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:56:15,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-1.i [2024-10-24 11:56:16,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:56:17,050 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:56:17,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-1.i [2024-10-24 11:56:17,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90780febd/f698a6b50346424d85d4a66cf6bd7569/FLAG4eda1266c [2024-10-24 11:56:17,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90780febd/f698a6b50346424d85d4a66cf6bd7569 [2024-10-24 11:56:17,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:56:17,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:56:17,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:56:17,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:56:17,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:56:17,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a812d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17, skipping insertion in model container [2024-10-24 11:56:17,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:56:17,352 WARN L248 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-1.i[916,929] [2024-10-24 11:56:17,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:56:17,467 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:56:17,480 WARN L248 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-1.i[916,929] [2024-10-24 11:56:17,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:56:17,556 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:56:17,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17 WrapperNode [2024-10-24 11:56:17,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:56:17,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:56:17,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:56:17,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:56:17,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,628 INFO L138 Inliner]: procedures = 36, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-10-24 11:56:17,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:56:17,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:56:17,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:56:17,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:56:17,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,692 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-24 11:56:17,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:56:17,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:56:17,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:56:17,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:56:17,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (1/1) ... [2024-10-24 11:56:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:56:17,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:56:17,777 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-10-24 11:56:17,780 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-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:56:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:56:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:56:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:56:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:56:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:56:17,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:56:17,968 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:56:17,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:56:18,746 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-24 11:56:18,747 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:56:18,835 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:56:18,836 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:56:18,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:18 BoogieIcfgContainer [2024-10-24 11:56:18,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:56:18,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:56:18,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:56:18,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:56:18,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:56:17" (1/3) ... [2024-10-24 11:56:18,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:56:18, skipping insertion in model container [2024-10-24 11:56:18,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:17" (2/3) ... [2024-10-24 11:56:18,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:56:18, skipping insertion in model container [2024-10-24 11:56:18,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:18" (3/3) ... [2024-10-24 11:56:18,847 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-1.i [2024-10-24 11:56:18,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:56:18,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:56:18,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:56:18,936 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;@5b6250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:56:18,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:56:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:56:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:56:18,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:18,957 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:56:18,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:18,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash -61330005, now seen corresponding path program 1 times [2024-10-24 11:56:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:56:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503630688] [2024-10-24 11:56:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:18,980 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-10-24 11:56:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:56:18,985 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-10-24 11:56:18,986 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-10-24 11:56:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:19,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:56:19,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:56:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-24 11:56:19,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:56:19,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:56:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503630688] [2024-10-24 11:56:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503630688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:19,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:56:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75345008] [2024-10-24 11:56:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:19,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:56:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:56:19,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:56:19,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:56:19,432 INFO L87 Difference]: Start difference. First operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:56:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:19,496 INFO L93 Difference]: Finished difference Result 187 states and 298 transitions. [2024-10-24 11:56:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:56:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-24 11:56:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:19,516 INFO L225 Difference]: With dead ends: 187 [2024-10-24 11:56:19,517 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:56:19,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-10-24 11:56:19,530 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:19,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:56:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:56:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:56:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-24 11:56:19,588 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 117 [2024-10-24 11:56:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:19,589 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-24 11:56:19,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:56:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-24 11:56:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:56:19,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:19,597 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:56:19,607 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-10-24 11:56:19,797 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-10-24 11:56:19,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1298615763, now seen corresponding path program 1 times [2024-10-24 11:56:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:56:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700242546] [2024-10-24 11:56:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:19,800 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-10-24 11:56:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:56:19,804 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-10-24 11:56:19,805 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-10-24 11:56:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:20,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:56:20,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:56:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:56:20,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:56:20,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:56:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700242546] [2024-10-24 11:56:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700242546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:56:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106697102] [2024-10-24 11:56:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:20,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:56:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:56:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:56:20,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:56:20,153 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:56:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:20,258 INFO L93 Difference]: Finished difference Result 190 states and 282 transitions. [2024-10-24 11:56:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:56:20,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-24 11:56:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:20,264 INFO L225 Difference]: With dead ends: 190 [2024-10-24 11:56:20,264 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:56:20,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-10-24 11:56:20,266 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:20,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:56:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:56:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 11:56:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:56:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-24 11:56:20,285 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 117 [2024-10-24 11:56:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-24 11:56:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:56:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-24 11:56:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:56:20,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:20,293 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:56:20,304 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-10-24 11:56:20,493 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-10-24 11:56:20,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:20,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1355874065, now seen corresponding path program 1 times [2024-10-24 11:56:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:56:20,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391935094] [2024-10-24 11:56:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:20,497 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-10-24 11:56:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:56:20,500 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-10-24 11:56:20,501 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-10-24 11:56:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:20,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:56:20,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:56:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:56:20,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:56:20,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:56:20,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391935094] [2024-10-24 11:56:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391935094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:20,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:56:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808783664] [2024-10-24 11:56:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:20,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:56:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:56:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:56:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:56:20,816 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:56:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:20,915 INFO L93 Difference]: Finished difference Result 196 states and 287 transitions. [2024-10-24 11:56:20,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:56:20,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-24 11:56:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:20,917 INFO L225 Difference]: With dead ends: 196 [2024-10-24 11:56:20,917 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:56:20,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:56:20,919 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:20,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:56:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:56:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 11:56:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:56:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-10-24 11:56:20,932 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 117 [2024-10-24 11:56:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:20,933 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-10-24 11:56:20,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:56:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-10-24 11:56:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:56:20,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:20,938 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:56:20,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:56:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:56:21,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1355933647, now seen corresponding path program 1 times [2024-10-24 11:56:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:56:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757664972] [2024-10-24 11:56:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:21,145 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-10-24 11:56:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:56:21,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:56:21,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:56:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:21,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 11:56:21,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:56:22,410 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-10-24 11:56:22,906 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 25 treesize of output 13