./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:50:54,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:50:54,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:50:54,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:50:54,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:50:54,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:50:54,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:50:54,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:50:54,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:50:54,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:50:54,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:50:54,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:50:54,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:50:54,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:50:54,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:50:54,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:50:54,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:50:54,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:50:54,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:50:54,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:50:54,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:50:54,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:50:54,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:50:54,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:50:54,629 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:50:54,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:50:54,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:50:54,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:50:54,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:50:54,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:50:54,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:50:54,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:50:54,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:50:54,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:50:54,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:50:54,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:50:54,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:50:54,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:50:54,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:50:54,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:50:54,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:50:54,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:50:54,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2024-11-16 18:50:54,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:50:54,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:50:54,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:50:54,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:50:54,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:50:54,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-16 18:50:56,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:50:56,655 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:50:56,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-16 18:50:56,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f442a39/2d4b4420eeb8406ea5f63974011ee56c/FLAG7495b0598 [2024-11-16 18:50:56,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f442a39/2d4b4420eeb8406ea5f63974011ee56c [2024-11-16 18:50:56,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:50:56,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:50:56,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:50:56,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:50:56,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:50:56,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:50:56" (1/1) ... [2024-11-16 18:50:57,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6684b663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:56, skipping insertion in model container [2024-11-16 18:50:57,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:50:56" (1/1) ... [2024-11-16 18:50:57,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:50:57,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-16 18:50:57,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:50:57,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:50:57,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-16 18:50:57,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:50:57,403 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:50:57,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57 WrapperNode [2024-11-16 18:50:57,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:50:57,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:50:57,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:50:57,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:50:57,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,460 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2024-11-16 18:50:57,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:50:57,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:50:57,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:50:57,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:50:57,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,504 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-16 18:50:57,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:50:57,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:50:57,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:50:57,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:50:57,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (1/1) ... [2024-11-16 18:50:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:50:57,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:50:57,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:50:57,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:50:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:50:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:50:57,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:50:57,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:50:57,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:50:57,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:50:57,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:50:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:50:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:50:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:50:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:50:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:50:57,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:50:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:50:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:50:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:50:57,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:50:57,764 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:50:57,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:50:58,143 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2024-11-16 18:50:58,185 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-16 18:50:58,186 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:50:58,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:50:58,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:50:58,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:50:58 BoogieIcfgContainer [2024-11-16 18:50:58,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:50:58,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:50:58,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:50:58,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:50:58,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:50:56" (1/3) ... [2024-11-16 18:50:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6613021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:50:58, skipping insertion in model container [2024-11-16 18:50:58,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:50:57" (2/3) ... [2024-11-16 18:50:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6613021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:50:58, skipping insertion in model container [2024-11-16 18:50:58,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:50:58" (3/3) ... [2024-11-16 18:50:58,206 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-16 18:50:58,222 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:50:58,222 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:50:58,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:50:58,288 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;@69c613b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:50:58,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:50:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:50:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 18:50:58,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:50:58,308 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:50:58,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:50:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:50:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1915253092, now seen corresponding path program 1 times [2024-11-16 18:50:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:50:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098019648] [2024-11-16 18:50:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:50:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:50:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:50:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:50:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:50:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:50:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:50:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:50:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:50:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:50:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:50:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 18:50:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:50:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098019648] [2024-11-16 18:50:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098019648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:50:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:50:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:50:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46659783] [2024-11-16 18:50:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:50:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:50:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:50:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:50:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:50:58,745 INFO L87 Difference]: Start difference. First operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:50:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:50:58,771 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2024-11-16 18:50:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:50:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-11-16 18:50:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:50:58,779 INFO L225 Difference]: With dead ends: 165 [2024-11-16 18:50:58,779 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 18:50:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:50:58,785 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:50:58,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:50:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 18:50:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-16 18:50:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:50:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-16 18:50:58,822 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 80 [2024-11-16 18:50:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:50:58,822 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-16 18:50:58,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:50:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-16 18:50:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 18:50:58,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:50:58,826 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:50:58,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:50:58,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:50:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:50:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1375936118, now seen corresponding path program 1 times [2024-11-16 18:50:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:50:58,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746337867] [2024-11-16 18:50:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:50:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:50:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:50:58,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:50:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:50:59,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:50:59,126 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:50:59,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:50:59,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:50:59,134 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 18:50:59,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:50:59,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:50:59 BoogieIcfgContainer [2024-11-16 18:50:59,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:50:59,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:50:59,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:50:59,257 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:50:59,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:50:58" (3/4) ... [2024-11-16 18:50:59,259 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:50:59,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:50:59,262 INFO L158 Benchmark]: Toolchain (without parser) took 2270.28ms. Allocated memory is still 169.9MB. Free memory was 100.3MB in the beginning and 111.7MB in the end (delta: -11.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:50:59,262 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:50:59,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.46ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 132.3MB in the end (delta: -32.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-16 18:50:59,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.20ms. Allocated memory is still 169.9MB. Free memory was 132.3MB in the beginning and 129.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:50:59,264 INFO L158 Benchmark]: Boogie Preprocessor took 66.57ms. Allocated memory is still 169.9MB. Free memory was 129.1MB in the beginning and 125.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:50:59,264 INFO L158 Benchmark]: IcfgBuilder took 670.68ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 98.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 18:50:59,265 INFO L158 Benchmark]: TraceAbstraction took 1055.33ms. Allocated memory is still 169.9MB. Free memory was 98.3MB in the beginning and 111.7MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:50:59,265 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 169.9MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:50:59,270 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 104.9MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.46ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 132.3MB in the end (delta: -32.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.20ms. Allocated memory is still 169.9MB. Free memory was 132.3MB in the beginning and 129.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.57ms. Allocated memory is still 169.9MB. Free memory was 129.1MB in the beginning and 125.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 670.68ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 98.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1055.33ms. Allocated memory is still 169.9MB. Free memory was 98.3MB in the beginning and 111.7MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 169.9MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_2_Pointer = &(WrapperStruct0.var_1_2); [L47] double* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L48] double* WrapperStruct0_var_1_4_Pointer = &(WrapperStruct0.var_1_4); [L49] double* WrapperStruct0_var_1_5_Pointer = &(WrapperStruct0.var_1_5); [L50] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L51] unsigned char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L52] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] unsigned short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L54] double last_1_WrapperStruct0_var_1_5 = 5.25; [L55] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L56] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=0, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR WrapperStruct0.var_1_5 [L107] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L108] EXPR WrapperStruct0.var_1_10 [L108] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L109] EXPR WrapperStruct0.var_1_13 [L109] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L92] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L97] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L99] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L102] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L120] RET updateVariables() [L121] CALL step() [L60] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L60] COND FALSE !((*(WrapperStruct0_var_1_9_Pointer))) [L65] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] COND TRUE ! (*(WrapperStruct0_var_1_2_Pointer)) [L71] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L71] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L71] (*(WrapperStruct0_var_1_1_Pointer)) = ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L75] COND FALSE !(((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) [L88] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L88] (*(WrapperStruct0_var_1_5_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) [L112] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112-L113] return ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 110 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 79 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:50:59,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:51:01,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:51:01,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:51:01,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:51:01,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:51:01,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:51:01,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:51:01,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:51:01,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:51:01,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:51:01,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:51:01,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:51:01,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:51:01,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:51:01,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:51:01,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:51:01,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:51:01,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:51:01,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:51:01,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:51:01,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:51:01,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:51:01,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:51:01,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:51:01,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:51:01,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:51:01,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:51:01,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:51:01,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:51:01,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:51:01,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:51:01,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:51:01,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:51:01,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:51:01,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:51:01,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:51:01,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:51:01,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:51:01,645 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:51:01,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:51:01,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:51:01,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:51:01,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:51:01,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:51:01,650 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2024-11-16 18:51:01,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:51:02,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:51:02,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:51:02,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:51:02,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:51:02,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-16 18:51:03,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:51:03,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:51:03,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-16 18:51:03,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc14167d/a8978d8ec05749bf8bc95285bccfa34d/FLAGa17f3fd36 [2024-11-16 18:51:03,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc14167d/a8978d8ec05749bf8bc95285bccfa34d [2024-11-16 18:51:03,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:51:03,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:51:03,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:51:03,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:51:03,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:51:03,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:51:03" (1/1) ... [2024-11-16 18:51:03,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee8433f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:03, skipping insertion in model container [2024-11-16 18:51:03,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:51:03" (1/1) ... [2024-11-16 18:51:03,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:51:03,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-16 18:51:04,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:51:04,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:51:04,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-16 18:51:04,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:51:04,169 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:51:04,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04 WrapperNode [2024-11-16 18:51:04,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:51:04,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:51:04,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:51:04,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:51:04,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,242 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2024-11-16 18:51:04,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:51:04,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:51:04,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:51:04,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:51:04,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,303 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-16 18:51:04,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:51:04,353 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:51:04,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:51:04,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:51:04,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (1/1) ... [2024-11-16 18:51:04,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:51:04,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:51:04,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:51:04,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:51:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:51:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-16 18:51:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-16 18:51:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 18:51:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 18:51:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:51:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:51:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:51:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:51:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:51:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:51:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-16 18:51:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-16 18:51:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:51:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:51:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:51:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:51:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:51:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:51:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:51:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:51:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:51:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:51:04,564 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:51:04,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:51:23,309 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2024-11-16 18:51:23,350 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-16 18:51:23,350 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:51:23,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:51:23,361 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:51:23,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:51:23 BoogieIcfgContainer [2024-11-16 18:51:23,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:51:23,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:51:23,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:51:23,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:51:23,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:51:03" (1/3) ... [2024-11-16 18:51:23,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a4b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:51:23, skipping insertion in model container [2024-11-16 18:51:23,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:51:04" (2/3) ... [2024-11-16 18:51:23,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a4b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:51:23, skipping insertion in model container [2024-11-16 18:51:23,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:51:23" (3/3) ... [2024-11-16 18:51:23,371 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-16 18:51:23,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:51:23,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:51:23,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:51:23,458 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;@4383e4fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:51:23,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:51:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:51:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 18:51:23,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:23,474 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:51:23,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:23,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1915253092, now seen corresponding path program 1 times [2024-11-16 18:51:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:51:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786660881] [2024-11-16 18:51:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:23,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:51:23,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:51:23,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:51:23,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:51:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:23,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:51:23,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:51:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-16 18:51:24,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:51:24,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:51:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786660881] [2024-11-16 18:51:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786660881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:24,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:24,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:51:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493417278] [2024-11-16 18:51:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:24,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:51:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:51:24,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:51:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:51:24,034 INFO L87 Difference]: Start difference. First operand has 88 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:51:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:51:24,060 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2024-11-16 18:51:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:51:24,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-16 18:51:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:51:24,070 INFO L225 Difference]: With dead ends: 165 [2024-11-16 18:51:24,070 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 18:51:24,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:51:24,076 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:51:24,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:51:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 18:51:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-16 18:51:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:51:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-16 18:51:24,114 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 80 [2024-11-16 18:51:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:51:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-16 18:51:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 18:51:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-16 18:51:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 18:51:24,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:24,118 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:51:24,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:51:24,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:51:24,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:24,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1375936118, now seen corresponding path program 1 times [2024-11-16 18:51:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:51:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075165301] [2024-11-16 18:51:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:51:24,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:51:24,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:51:24,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:51:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:24,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:51:24,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:51:25,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:51:25,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-16 18:51:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-16 18:51:25,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:51:25,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:51:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075165301] [2024-11-16 18:51:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075165301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:51:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521075019] [2024-11-16 18:51:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:25,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:51:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:51:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:51:25,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:51:25,385 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:51:28,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:32,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:35,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:42,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:46,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:49,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:51:49,838 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2024-11-16 18:51:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:51:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-11-16 18:51:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:51:49,870 INFO L225 Difference]: With dead ends: 158 [2024-11-16 18:51:49,870 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 18:51:49,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:51:49,872 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:51:49,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 292 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 24.3s Time] [2024-11-16 18:51:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 18:51:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-16 18:51:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:51:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2024-11-16 18:51:49,881 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 80 [2024-11-16 18:51:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:51:49,883 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2024-11-16 18:51:49,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:51:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2024-11-16 18:51:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:51:49,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:51:49,886 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:51:49,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:51:50,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:51:50,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:51:50,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:51:50,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2132640728, now seen corresponding path program 1 times [2024-11-16 18:51:50,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:51:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083296421] [2024-11-16 18:51:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:51:50,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:51:50,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:51:50,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:51:50,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:51:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:51:50,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:51:50,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:51:51,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:51:51,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-16 18:51:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:51:51,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:51:51,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:51:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083296421] [2024-11-16 18:51:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083296421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:51:51,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:51:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:51:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317715839] [2024-11-16 18:51:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:51:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:51:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:51:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:51:51,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:51:51,142 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:51:55,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:51:58,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:00,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:10,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:14,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:18,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:22,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:26,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:30,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:31,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:52:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:31,800 INFO L93 Difference]: Finished difference Result 158 states and 216 transitions. [2024-11-16 18:52:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2024-11-16 18:52:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:31,833 INFO L225 Difference]: With dead ends: 158 [2024-11-16 18:52:31,833 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 18:52:31,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:52:31,835 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 85 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:31,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 286 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 40.5s Time] [2024-11-16 18:52:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 18:52:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-16 18:52:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 18:52:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2024-11-16 18:52:31,846 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 82 [2024-11-16 18:52:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:31,846 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2024-11-16 18:52:31,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 18:52:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-11-16 18:52:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-16 18:52:31,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:31,848 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:31,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 18:52:32,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:52:32,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:32,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1895883018, now seen corresponding path program 1 times [2024-11-16 18:52:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:52:32,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699789734] [2024-11-16 18:52:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:52:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:52:32,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:52:32,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:52:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:35,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-16 18:52:35,508 INFO L278 TraceCheckSpWp]: Computing forward predicates...