./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-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:05:35,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:05:36,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:05:36,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:05:36,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:05:36,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:05:36,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:05:36,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:05:36,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:05:36,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:05:36,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:05:36,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:05:36,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:05:36,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:05:36,092 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:05:36,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:05:36,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:05:36,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:05:36,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:05:36,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:05:36,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:05:36,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:05:36,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:05:36,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:05:36,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:05:36,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:05:36,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:05:36,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:05:36,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:05:36,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:05:36,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:05:36,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:05:36,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:05:36,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:05:36,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:05:36,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:05:36,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:05:36,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:05:36,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:05:36,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:05:36,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:05:36,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:05:36,100 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-clean/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-clean/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 -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2024-10-11 14:05:36,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:05:36,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:05:36,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:05:36,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:05:36,429 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:05:36,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-11 14:05:37,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:05:38,074 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:05:38,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-11 14:05:38,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/118331777/99dc6a1e682e46d7bb3d739fd69bdc05/FLAG6bd04fc6f [2024-10-11 14:05:38,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/118331777/99dc6a1e682e46d7bb3d739fd69bdc05 [2024-10-11 14:05:38,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:05:38,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:05:38,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:05:38,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:05:38,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:05:38,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bed56b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38, skipping insertion in model container [2024-10-11 14:05:38,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:05:38,671 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-95.i[917,930] [2024-10-11 14:05:38,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:05:38,749 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:05:38,764 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-95.i[917,930] [2024-10-11 14:05:38,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:05:38,829 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:05:38,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38 WrapperNode [2024-10-11 14:05:38,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:05:38,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:05:38,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:05:38,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:05:38,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,897 INFO L138 Inliner]: procedures = 29, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-10-11 14:05:38,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:05:38,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:05:38,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:05:38,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:05:38,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,946 INFO L175 MemorySlicer]: Split 121 memory accesses to 2 slices as follows [2, 119]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2024-10-11 14:05:38,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:38,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:05:38,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:05:38,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:05:38,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:05:38,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (1/1) ... [2024-10-11 14:05:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:05:39,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:05:39,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:05:39,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:05:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:05:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:05:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:05:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:05:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:05:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:05:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:05:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:05:39,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:05:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:05:39,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:05:39,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:05:39,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:05:39,806 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-10-11 14:05:39,807 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:05:39,842 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:05:39,843 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:05:39,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:05:39 BoogieIcfgContainer [2024-10-11 14:05:39,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:05:39,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:05:39,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:05:39,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:05:39,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:05:38" (1/3) ... [2024-10-11 14:05:39,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67954c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:05:39, skipping insertion in model container [2024-10-11 14:05:39,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:05:38" (2/3) ... [2024-10-11 14:05:39,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67954c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:05:39, skipping insertion in model container [2024-10-11 14:05:39,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:05:39" (3/3) ... [2024-10-11 14:05:39,855 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-11 14:05:39,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:05:39,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:05:39,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:05:39,948 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;@ebd4125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:05:39,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:05:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:05:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 14:05:39,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:39,972 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:05:39,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:39,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 813246003, now seen corresponding path program 1 times [2024-10-11 14:05:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:39,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737101600] [2024-10-11 14:05:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:05:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:05:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:05:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:05:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:05:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:05:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:05:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:05:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:05:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:05:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:05:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:05:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 14:05:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 14:05:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:05:40,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:40,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737101600] [2024-10-11 14:05:40,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737101600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:40,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:40,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:05:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527457372] [2024-10-11 14:05:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:05:40,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:05:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:05:40,544 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:05:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:40,598 INFO L93 Difference]: Finished difference Result 211 states and 334 transitions. [2024-10-11 14:05:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:05:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2024-10-11 14:05:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:40,612 INFO L225 Difference]: With dead ends: 211 [2024-10-11 14:05:40,613 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 14:05:40,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11 14:05:40,623 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:40,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:05:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 14:05:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 14:05:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:05:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-11 14:05:40,681 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 127 [2024-10-11 14:05:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:40,682 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-11 14:05:40,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:05:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-11 14:05:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 14:05:40,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:40,691 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:05:40,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:05:40,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:40,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1908889257, now seen corresponding path program 1 times [2024-10-11 14:05:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30476498] [2024-10-11 14:05:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:05:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:05:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:05:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:05:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:05:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:05:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:05:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:05:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:05:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:05:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:05:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:05:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 14:05:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 14:05:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:05:41,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30476498] [2024-10-11 14:05:41,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30476498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:41,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:41,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:05:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732059544] [2024-10-11 14:05:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:05:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:41,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:05:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:05:41,189 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:05:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:41,257 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-11 14:05:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:05:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-10-11 14:05:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:41,261 INFO L225 Difference]: With dead ends: 212 [2024-10-11 14:05:41,261 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 14:05:41,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-11 14:05:41,263 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 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-11 14:05:41,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:05:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 14:05:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-11 14:05:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:05:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-11 14:05:41,280 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 127 [2024-10-11 14:05:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-11 14:05:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:05:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-11 14:05:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 14:05:41,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:41,288 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:05:41,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:05:41,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:41,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1908829675, now seen corresponding path program 1 times [2024-10-11 14:05:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690179870] [2024-10-11 14:05:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:05:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:05:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:05:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:05:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:05:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:05:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:05:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:05:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:05:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:05:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:05:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:05:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 14:05:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 14:05:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:05:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690179870] [2024-10-11 14:05:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690179870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:42,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:05:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663406821] [2024-10-11 14:05:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:42,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:05:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:05:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:05:42,749 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:05:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:43,299 INFO L93 Difference]: Finished difference Result 256 states and 365 transitions. [2024-10-11 14:05:43,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:05:43,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2024-10-11 14:05:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:43,304 INFO L225 Difference]: With dead ends: 256 [2024-10-11 14:05:43,304 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 14:05:43,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:05:43,310 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 372 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:43,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 275 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:05:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 14:05:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2024-10-11 14:05:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:05:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-10-11 14:05:43,330 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 127 [2024-10-11 14:05:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:43,331 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-10-11 14:05:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:05:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-10-11 14:05:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 14:05:43,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:43,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:05:43,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:05:43,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:43,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash 151429946, now seen corresponding path program 1 times [2024-10-11 14:05:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:43,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190775290] [2024-10-11 14:05:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:05:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:05:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:05:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:05:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:05:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:05:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:05:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:05:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:05:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:05:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:05:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:05:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:05:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 14:05:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 14:05:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 14:05:45,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190775290] [2024-10-11 14:05:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190775290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:05:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033597056] [2024-10-11 14:05:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:45,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:05:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:05:45,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:05:45,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:05:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:46,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 14:05:46,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:05:47,122 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-11 14:05:47,730 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 [2024-10-11 14:05:48,178 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 [2024-10-11 14:05:48,601 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 [2024-10-11 14:05:49,044 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 [2024-10-11 14:05:49,644 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 [2024-10-11 14:05:49,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,001 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 [2024-10-11 14:05:50,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,165 INFO L349 Elim1Store]: treesize reduction 113, result has 23.1 percent of original size [2024-10-11 14:05:50,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 125 [2024-10-11 14:05:50,247 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-11 14:05:50,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 65 [2024-10-11 14:05:50,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-11 14:05:50,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,318 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-10-11 14:05:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2024-10-11 14:05:50,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:05:50,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-10-11 14:05:50,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:05:50,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 257 [2024-10-11 14:05:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 139 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-11 14:05:52,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:06:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033597056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:06:04,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:06:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2024-10-11 14:06:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549038486] [2024-10-11 14:06:04,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:06:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 14:06:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:06:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 14:06:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=626, Unknown=2, NotChecked=0, Total=756 [2024-10-11 14:06:04,329 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 23 states have internal predecessors, (99), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2024-10-11 14:06:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:05,742 INFO L93 Difference]: Finished difference Result 298 states and 422 transitions. [2024-10-11 14:06:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 14:06:05,744 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 23 states have internal predecessors, (99), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) Word has length 129 [2024-10-11 14:06:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:05,750 INFO L225 Difference]: With dead ends: 298 [2024-10-11 14:06:05,750 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 14:06:05,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=251, Invalid=937, Unknown=2, NotChecked=0, Total=1190 [2024-10-11 14:06:05,756 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 504 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:05,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 714 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:06:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 14:06:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2024-10-11 14:06:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:06:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 250 transitions. [2024-10-11 14:06:05,785 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 250 transitions. Word has length 129 [2024-10-11 14:06:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:05,786 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 250 transitions. [2024-10-11 14:06:05,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.714285714285714) internal successors, (99), 23 states have internal predecessors, (99), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2024-10-11 14:06:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 250 transitions. [2024-10-11 14:06:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 14:06:05,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:05,789 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:05,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:06:05,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:05,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1133992494, now seen corresponding path program 1 times [2024-10-11 14:06:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:06:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502530484] [2024-10-11 14:06:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:06:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:06:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:06:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:06:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:06:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:06:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:06:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:06:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:06:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:06:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:06:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:06:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:06:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:06:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:06:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 14:06:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 14:06:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:06:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:06:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502530484] [2024-10-11 14:06:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502530484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:06:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353320218] [2024-10-11 14:06:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:06:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:06:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:06:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:06:06,728 INFO L87 Difference]: Start difference. First operand 176 states and 250 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:07,498 INFO L93 Difference]: Finished difference Result 482 states and 680 transitions. [2024-10-11 14:06:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:06:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-11 14:06:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:07,503 INFO L225 Difference]: With dead ends: 482 [2024-10-11 14:06:07,504 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 14:06:07,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:06:07,507 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 161 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:07,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 590 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:06:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 14:06:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2024-10-11 14:06:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 198 states have internal predecessors, (267), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 14:06:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 337 transitions. [2024-10-11 14:06:07,562 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 337 transitions. Word has length 130 [2024-10-11 14:06:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:07,563 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 337 transitions. [2024-10-11 14:06:07,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 337 transitions. [2024-10-11 14:06:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 14:06:07,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:07,565 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:07,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:06:07,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:07,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1744032267, now seen corresponding path program 1 times [2024-10-11 14:06:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:06:07,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608927196] [2024-10-11 14:06:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:06:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:06:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:06:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:06:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:06:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:06:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:06:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:06:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:06:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:06:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:06:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:06:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:06:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:06:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 14:06:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 14:06:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 14:06:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:06:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:06:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608927196] [2024-10-11 14:06:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608927196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:06:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687501169] [2024-10-11 14:06:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:08,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:06:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:06:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:06:08,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:06:08,793 INFO L87 Difference]: Start difference. First operand 237 states and 337 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:09,257 INFO L93 Difference]: Finished difference Result 412 states and 586 transitions. [2024-10-11 14:06:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:06:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-10-11 14:06:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:09,261 INFO L225 Difference]: With dead ends: 412 [2024-10-11 14:06:09,261 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 14:06:09,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:06:09,264 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 237 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:09,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 212 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:06:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 14:06:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-10-11 14:06:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 194 states have internal predecessors, (261), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 14:06:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2024-10-11 14:06:09,310 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 130 [2024-10-11 14:06:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2024-10-11 14:06:09,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2024-10-11 14:06:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 14:06:09,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:09,315 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:06:09,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1563475376, now seen corresponding path program 1 times [2024-10-11 14:06:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:06:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792725558] [2024-10-11 14:06:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:06:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:06:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387320606] [2024-10-11 14:06:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:06:09,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:06:09,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:06:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:06:09,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:06:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:06:10,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:06:10,270 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:06:10,272 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:06:10,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:06:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:06:10,480 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:06:10,644 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:06:10,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:06:10 BoogieIcfgContainer [2024-10-11 14:06:10,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:06:10,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:06:10,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:06:10,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:06:10,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:05:39" (3/4) ... [2024-10-11 14:06:10,653 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 14:06:10,654 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:06:10,655 INFO L158 Benchmark]: Toolchain (without parser) took 32196.61ms. Allocated memory was 165.7MB in the beginning and 394.3MB in the end (delta: 228.6MB). Free memory was 130.3MB in the beginning and 312.8MB in the end (delta: -182.5MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-11 14:06:10,655 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:06:10,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.98ms. Allocated memory is still 165.7MB. Free memory was 129.5MB in the beginning and 112.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 14:06:10,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.83ms. Allocated memory is still 165.7MB. Free memory was 112.7MB in the beginning and 108.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:06:10,656 INFO L158 Benchmark]: Boogie Preprocessor took 92.96ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 103.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:06:10,656 INFO L158 Benchmark]: RCFGBuilder took 851.94ms. Allocated memory is still 165.7MB. Free memory was 103.6MB in the beginning and 101.2MB in the end (delta: 2.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 14:06:10,656 INFO L158 Benchmark]: TraceAbstraction took 30803.52ms. Allocated memory was 165.7MB in the beginning and 394.3MB in the end (delta: 228.6MB). Free memory was 100.7MB in the beginning and 312.8MB in the end (delta: -212.0MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-11 14:06:10,656 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 394.3MB. Free memory is still 312.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:06:10,658 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.17ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.98ms. Allocated memory is still 165.7MB. Free memory was 129.5MB in the beginning and 112.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.83ms. Allocated memory is still 165.7MB. Free memory was 112.7MB in the beginning and 108.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.96ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 103.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 851.94ms. Allocated memory is still 165.7MB. Free memory was 103.6MB in the beginning and 101.2MB in the end (delta: 2.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30803.52ms. Allocated memory was 165.7MB in the beginning and 394.3MB in the end (delta: 228.6MB). Free memory was 100.7MB in the beginning and 312.8MB in the end (delta: -212.0MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 394.3MB. Free memory is still 312.8MB. 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 121, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L55] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L62] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] unsigned char last_1_WrapperStruct00_var_1_7 = 0; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_7 [L118] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L73] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))) [L74] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) [L74] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] (*(WrapperStruct00_var_1_3_Pointer)) = (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))) [L75] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L75] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] EXPR (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)); [L77] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L77] COND TRUE (- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > stepLocal_0 [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] EXPR (*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] COND FALSE !(((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L83] COND TRUE (*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L84] (*(WrapperStruct00_var_1_13_Pointer)) = (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) [L121] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121-L122] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1281 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1275 mSDsluCounter, 2366 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1681 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 685 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 105 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 892 ConstructedInterpolants, 2 QuantifiedInterpolants, 10584 SizeOfPredicates, 14 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 3188/3360 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-11 14:06:10,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:06:12,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:06:12,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 14:06:12,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:06:12,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:06:13,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:06:13,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:06:13,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:06:13,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:06:13,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:06:13,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:06:13,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:06:13,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:06:13,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:06:13,029 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:06:13,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:06:13,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:06:13,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:06:13,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:06:13,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:06:13,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:06:13,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:06:13,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:06:13,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 14:06:13,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 14:06:13,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:06:13,035 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 14:06:13,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:06:13,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:06:13,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:06:13,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:06:13,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:06:13,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:06:13,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:06:13,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:06:13,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:06:13,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:06:13,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:06:13,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 14:06:13,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 14:06:13,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:06:13,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:06:13,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:06:13,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:06:13,046 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 14:06:13,046 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-clean/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-clean/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 -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2024-10-11 14:06:13,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:06:13,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:06:13,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:06:13,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:06:13,440 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:06:13,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-11 14:06:15,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:06:15,218 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:06:15,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-11 14:06:15,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2c5cacef7/da626f39acb94293bb907a925bd9aea7/FLAGabeadab71 [2024-10-11 14:06:15,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2c5cacef7/da626f39acb94293bb907a925bd9aea7 [2024-10-11 14:06:15,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:06:15,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:06:15,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:06:15,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:06:15,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:06:15,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:06:15" (1/1) ... [2024-10-11 14:06:15,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34147e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:15, skipping insertion in model container [2024-10-11 14:06:15,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:06:15" (1/1) ... [2024-10-11 14:06:15,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:06:15,821 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-95.i[917,930] [2024-10-11 14:06:15,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:06:15,921 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:06:15,935 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-95.i[917,930] [2024-10-11 14:06:15,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:06:16,024 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:06:16,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16 WrapperNode [2024-10-11 14:06:16,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:06:16,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:06:16,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:06:16,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:06:16,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,102 INFO L138 Inliner]: procedures = 36, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-10-11 14:06:16,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:06:16,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:06:16,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:06:16,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:06:16,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,168 INFO L175 MemorySlicer]: Split 121 memory accesses to 2 slices as follows [2, 119]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2024-10-11 14:06:16,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:06:16,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:06:16,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:06:16,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:06:16,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (1/1) ... [2024-10-11 14:06:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:06:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:06:16,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:06:16,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:06:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:06:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 14:06:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 14:06:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 14:06:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 14:06:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 14:06:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 14:06:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 14:06:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 14:06:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:06:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:06:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:06:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:06:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 14:06:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 14:06:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 14:06:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 14:06:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 14:06:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 14:06:16,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:06:16,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:06:17,714 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-11 14:06:17,715 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:06:17,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:06:17,786 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:06:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:06:17 BoogieIcfgContainer [2024-10-11 14:06:17,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:06:17,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:06:17,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:06:17,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:06:17,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:06:15" (1/3) ... [2024-10-11 14:06:17,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bdc0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:06:17, skipping insertion in model container [2024-10-11 14:06:17,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:06:16" (2/3) ... [2024-10-11 14:06:17,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bdc0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:06:17, skipping insertion in model container [2024-10-11 14:06:17,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:06:17" (3/3) ... [2024-10-11 14:06:17,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2024-10-11 14:06:17,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:06:17,814 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:06:17,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:06:17,884 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;@bc46ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:06:17,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:06:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:06:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 14:06:17,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:17,901 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:17,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:17,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1048508411, now seen corresponding path program 1 times [2024-10-11 14:06:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:06:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773539436] [2024-10-11 14:06:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:17,922 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-11 14:06:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:06:17,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 14:06:17,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:06:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:18,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 14:06:18,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-11 14:06:18,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:06:18,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:06:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773539436] [2024-10-11 14:06:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773539436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:18,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:18,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:06:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3052352] [2024-10-11 14:06:18,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:18,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:06:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:06:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:06:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:06:18,564 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:18,621 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-11 14:06:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:06:18,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2024-10-11 14:06:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:18,631 INFO L225 Difference]: With dead ends: 189 [2024-10-11 14:06:18,631 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 14:06:18,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-11 14:06:18,638 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:18,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:06:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 14:06:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 14:06:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:06:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-11 14:06:18,679 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 124 [2024-10-11 14:06:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-11 14:06:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-11 14:06:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 14:06:18,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:18,683 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:18,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:06:18,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 14:06:18,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1529800535, now seen corresponding path program 1 times [2024-10-11 14:06:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:06:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702922483] [2024-10-11 14:06:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:18,891 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-11 14:06:18,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:06:18,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 14:06:18,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:06:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:19,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:06:19,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:06:19,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:06:19,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:06:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702922483] [2024-10-11 14:06:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702922483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:06:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799683301] [2024-10-11 14:06:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:19,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:06:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:06:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:06:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:06:19,474 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:19,839 INFO L93 Difference]: Finished difference Result 194 states and 277 transitions. [2024-10-11 14:06:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:06:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2024-10-11 14:06:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:19,842 INFO L225 Difference]: With dead ends: 194 [2024-10-11 14:06:19,842 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:06:19,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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-11 14:06:19,846 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:19,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 608 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:06:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:06:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:06:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:06:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2024-10-11 14:06:19,867 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 124 [2024-10-11 14:06:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:19,869 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2024-10-11 14:06:19,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2024-10-11 14:06:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 14:06:19,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:19,876 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:19,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:06:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 14:06:20,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1529860117, now seen corresponding path program 1 times [2024-10-11 14:06:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:06:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389451829] [2024-10-11 14:06:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:20,082 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-11 14:06:20,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:06:20,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 14:06:20,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:06:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:20,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 14:06:20,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:20,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 14:06:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:06:20,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:06:20,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:06:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389451829] [2024-10-11 14:06:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389451829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:06:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654577113] [2024-10-11 14:06:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:06:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:06:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:06:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:06:20,813 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:22,562 INFO L93 Difference]: Finished difference Result 200 states and 280 transitions. [2024-10-11 14:06:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:06:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2024-10-11 14:06:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:22,565 INFO L225 Difference]: With dead ends: 200 [2024-10-11 14:06:22,565 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:06:22,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:06:22,567 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 131 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:22,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 367 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 14:06:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:06:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:06:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:06:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-11 14:06:22,577 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 124 [2024-10-11 14:06:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:22,578 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-11 14:06:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-11 14:06:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 14:06:22,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:22,580 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:22,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 14:06:22,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 14:06:22,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:22,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1656346673, now seen corresponding path program 1 times [2024-10-11 14:06:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:06:22,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060142493] [2024-10-11 14:06:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:22,786 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-11 14:06:22,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:06:22,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 14:06:22,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 14:06:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:23,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:06:23,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:23,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 14:06:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 14:06:23,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:06:23,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:06:23,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060142493] [2024-10-11 14:06:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060142493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:23,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:06:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442622156] [2024-10-11 14:06:23,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:23,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:06:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:06:23,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:06:23,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:06:23,356 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:25,176 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2024-10-11 14:06:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:06:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-11 14:06:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:25,178 INFO L225 Difference]: With dead ends: 200 [2024-10-11 14:06:25,178 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:06:25,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:06:25,180 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 119 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:25,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 362 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 14:06:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:06:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:06:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:06:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-10-11 14:06:25,190 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 126 [2024-10-11 14:06:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-10-11 14:06:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-10-11 14:06:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 14:06:25,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:25,193 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:25,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 14:06:25,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 14:06:25,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash 689543765, now seen corresponding path program 1 times [2024-10-11 14:06:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:06:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494718443] [2024-10-11 14:06:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:25,396 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-11 14:06:25,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:06:25,399 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 14:06:25,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 14:06:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:25,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:06:25,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:25,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 14:06:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-11 14:06:26,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:06:26,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:06:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494718443] [2024-10-11 14:06:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494718443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:06:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636743369] [2024-10-11 14:06:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:26,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:06:26,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:06:26,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:06:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:06:26,018 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:27,471 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2024-10-11 14:06:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:06:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-10-11 14:06:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:27,473 INFO L225 Difference]: With dead ends: 200 [2024-10-11 14:06:27,473 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:06:27,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:06:27,474 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 111 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:27,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 358 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 14:06:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:06:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:06:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:06:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-10-11 14:06:27,490 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 128 [2024-10-11 14:06:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:27,490 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-10-11 14:06:27,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 14:06:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-10-11 14:06:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 14:06:27,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:27,496 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:27,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 14:06:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 14:06:27,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:06:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:06:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1952116751, now seen corresponding path program 1 times [2024-10-11 14:06:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:06:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87364542] [2024-10-11 14:06:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:06:27,699 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-11 14:06:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:06:27,700 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 14:06:27,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 14:06:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:06:28,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 14:06:28,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:06:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 14:06:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-10-11 14:06:31,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-10-11 14:06:31,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-10-11 14:06:32,238 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-10-11 14:06:32,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 71 [2024-10-11 14:06:35,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:06:35,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 261 treesize of output 825 [2024-10-11 14:06:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 14:06:35,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:06:35,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:06:35,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87364542] [2024-10-11 14:06:35,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87364542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:06:35,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:06:35,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:06:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472185965] [2024-10-11 14:06:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:06:35,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:06:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:06:35,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:06:35,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:06:35,400 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:46,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:06:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:06:52,704 INFO L93 Difference]: Finished difference Result 421 states and 576 transitions. [2024-10-11 14:06:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:06:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-11 14:06:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:06:52,708 INFO L225 Difference]: With dead ends: 421 [2024-10-11 14:06:52,708 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 14:06:52,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:06:52,709 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 533 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:06:52,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 499 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 15.9s Time] [2024-10-11 14:06:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 14:06:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 190. [2024-10-11 14:06:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 14:06:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2024-10-11 14:06:52,740 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 130 [2024-10-11 14:06:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:06:52,741 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2024-10-11 14:06:52,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 14:06:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2024-10-11 14:06:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 14:06:52,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:06:52,743 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:06:52,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0