./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-73.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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:01:02,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:01:02,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:01:02,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:01:02,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:01:02,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:01:02,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:01:02,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:01:02,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:01:02,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:01:02,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:01:02,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:01:02,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:01:02,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:01:02,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:01:02,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:01:02,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:01:02,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:01:02,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:01:02,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:01:02,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:01:02,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:01:02,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:01:02,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:01:02,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:01:02,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:01:02,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:01:02,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:01:02,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:01:02,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:01:02,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:01:02,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:01:02,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:02,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:01:02,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:01:02,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:01:02,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:01:02,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:01:02,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:01:02,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:01:02,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:01:02,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:01:02,590 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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-10 10:01:02,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:01:02,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:01:02,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:01:02,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:01:02,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:01:02,914 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-73.i [2024-11-10 10:01:04,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:01:04,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:01:04,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-10 10:01:04,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f84bdb6/2e63413be6ad4d1cbce90049c5c12a77/FLAG740cb5221 [2024-11-10 10:01:05,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f84bdb6/2e63413be6ad4d1cbce90049c5c12a77 [2024-11-10 10:01:05,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:01:05,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:01:05,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:05,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:01:05,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:01:05,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d495bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05, skipping insertion in model container [2024-11-10 10:01:05,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:01:05,267 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-73.i[917,930] [2024-11-10 10:01:05,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:05,369 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:01:05,383 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-73.i[917,930] [2024-11-10 10:01:05,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:05,466 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:01:05,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05 WrapperNode [2024-11-10 10:01:05,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:05,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:05,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:01:05,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:01:05,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,547 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2024-11-10 10:01:05,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:05,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:01:05,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:01:05,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:01:05,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,584 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:01:05,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:01:05,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:01:05,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:01:05,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:01:05,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (1/1) ... [2024-11-10 10:01:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:05,677 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-10 10:01:05,680 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-10 10:01:05,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:01:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:01:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:01:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:01:05,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:01:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:01:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:01:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:01:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:01:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:01:05,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:01:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:01:05,871 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:01:05,873 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:01:06,438 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2024-11-10 10:01:06,500 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-10 10:01:06,500 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:01:06,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:01:06,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:01:06,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:06 BoogieIcfgContainer [2024-11-10 10:01:06,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:01:06,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:01:06,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:01:06,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:01:06,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:01:05" (1/3) ... [2024-11-10 10:01:06,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24026b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:06, skipping insertion in model container [2024-11-10 10:01:06,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:05" (2/3) ... [2024-11-10 10:01:06,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24026b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:06, skipping insertion in model container [2024-11-10 10:01:06,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:06" (3/3) ... [2024-11-10 10:01:06,530 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-10 10:01:06,548 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:01:06,548 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:01:06,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:01:06,626 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;@4798cdbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:01:06,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:01:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 10:01:06,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:06,645 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:06,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:06,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash 954589932, now seen corresponding path program 1 times [2024-11-10 10:01:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448632272] [2024-11-10 10:01:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:06,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448632272] [2024-11-10 10:01:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448632272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:01:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857031386] [2024-11-10 10:01:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:07,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:01:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:07,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:01:07,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:01:07,242 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:07,282 INFO L93 Difference]: Finished difference Result 218 states and 338 transitions. [2024-11-10 10:01:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:01:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-10 10:01:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:07,294 INFO L225 Difference]: With dead ends: 218 [2024-11-10 10:01:07,295 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 10:01:07,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-10 10:01:07,303 INFO L432 NwaCegarLoop]: 157 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, 157 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-10 10:01:07,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 10:01:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 10:01:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-10 10:01:07,344 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 131 [2024-11-10 10:01:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:07,345 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-10 10:01:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-10 10:01:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 10:01:07,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:07,349 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:01:07,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1958418709, now seen corresponding path program 1 times [2024-11-10 10:01:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713401342] [2024-11-10 10:01:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:07,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713401342] [2024-11-10 10:01:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713401342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:07,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068104014] [2024-11-10 10:01:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:07,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:07,949 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:08,009 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-10 10:01:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-10 10:01:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:08,016 INFO L225 Difference]: With dead ends: 215 [2024-11-10 10:01:08,017 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 10:01:08,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:08,020 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:08,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 10:01:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 10:01:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-10 10:01:08,037 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2024-11-10 10:01:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:08,039 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-10 10:01:08,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-10 10:01:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 10:01:08,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:08,042 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:08,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:01:08,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2038385229, now seen corresponding path program 1 times [2024-11-10 10:01:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:08,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355486880] [2024-11-10 10:01:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355486880] [2024-11-10 10:01:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355486880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129472512] [2024-11-10 10:01:08,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:08,368 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:08,414 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2024-11-10 10:01:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:08,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-10 10:01:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:08,417 INFO L225 Difference]: With dead ends: 220 [2024-11-10 10:01:08,417 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 10:01:08,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:08,421 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:08,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 10:01:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-10 10:01:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-10 10:01:08,438 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 133 [2024-11-10 10:01:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:08,441 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-10 10:01:08,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-10 10:01:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 10:01:08,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:08,446 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:08,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:01:08,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:08,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash -513771732, now seen corresponding path program 1 times [2024-11-10 10:01:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024803502] [2024-11-10 10:01:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:08,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024803502] [2024-11-10 10:01:08,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024803502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:08,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:08,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920922959] [2024-11-10 10:01:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:08,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:01:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:01:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:08,935 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:09,256 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2024-11-10 10:01:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:01:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-10 10:01:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:09,258 INFO L225 Difference]: With dead ends: 223 [2024-11-10 10:01:09,258 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 10:01:09,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:09,260 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:09,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:01:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 10:01:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-10 10:01:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-10 10:01:09,277 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 133 [2024-11-10 10:01:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:09,279 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-10 10:01:09,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-10 10:01:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 10:01:09,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:09,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:09,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:01:09,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1743139275, now seen corresponding path program 1 times [2024-11-10 10:01:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:09,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964593256] [2024-11-10 10:01:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964593256] [2024-11-10 10:01:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964593256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:11,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:01:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230678180] [2024-11-10 10:01:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:11,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:01:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:01:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:01:11,859 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:12,565 INFO L93 Difference]: Finished difference Result 296 states and 428 transitions. [2024-11-10 10:01:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:01:12,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-10 10:01:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:12,568 INFO L225 Difference]: With dead ends: 296 [2024-11-10 10:01:12,568 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 10:01:12,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:01:12,569 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 67 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:12,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 509 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 10:01:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 10:01:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2024-11-10 10:01:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 10:01:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2024-11-10 10:01:12,589 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 133 [2024-11-10 10:01:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:12,589 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2024-11-10 10:01:12,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-11-10 10:01:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 10:01:12,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:12,592 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:12,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:01:12,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:12,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 269585470, now seen corresponding path program 1 times [2024-11-10 10:01:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60288930] [2024-11-10 10:01:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:12,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60288930] [2024-11-10 10:01:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60288930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:01:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266466725] [2024-11-10 10:01:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:01:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:01:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:01:14,265 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:14,828 INFO L93 Difference]: Finished difference Result 294 states and 425 transitions. [2024-11-10 10:01:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:14,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-10 10:01:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:14,831 INFO L225 Difference]: With dead ends: 294 [2024-11-10 10:01:14,831 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 10:01:14,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:01:14,832 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:14,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 506 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 10:01:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 10:01:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2024-11-10 10:01:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 10:01:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 254 transitions. [2024-11-10 10:01:14,845 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 254 transitions. Word has length 134 [2024-11-10 10:01:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:14,845 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 254 transitions. [2024-11-10 10:01:14,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2024-11-10 10:01:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 10:01:14,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:14,847 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:14,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:01:14,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:14,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1514349951, now seen corresponding path program 1 times [2024-11-10 10:01:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242314865] [2024-11-10 10:01:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 10:01:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 10:01:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 10:01:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 10:01:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 10:01:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 10:01:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242314865] [2024-11-10 10:01:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242314865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:01:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694071542] [2024-11-10 10:01:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:01:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:01:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:16,969 INFO L87 Difference]: Start difference. First operand 176 states and 254 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:17,452 INFO L93 Difference]: Finished difference Result 337 states and 482 transitions. [2024-11-10 10:01:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-10 10:01:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:17,454 INFO L225 Difference]: With dead ends: 337 [2024-11-10 10:01:17,454 INFO L226 Difference]: Without dead ends: 226 [2024-11-10 10:01:17,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:01:17,456 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 247 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:17,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 323 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 10:01:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-10 10:01:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 182. [2024-11-10 10:01:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 149 states have (on average 1.348993288590604) internal successors, (201), 149 states have internal predecessors, (201), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 10:01:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 261 transitions. [2024-11-10 10:01:17,480 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 261 transitions. Word has length 134 [2024-11-10 10:01:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:17,481 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 261 transitions. [2024-11-10 10:01:17,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2024-11-10 10:01:17,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 10:01:17,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:17,482 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:17,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:01:17,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1427307648, now seen corresponding path program 1 times [2024-11-10 10:01:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169045655] [2024-11-10 10:01:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:01:17,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:01:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:01:17,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:01:17,784 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:01:17,786 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 10:01:17,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:01:17,791 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:17,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:01:17,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:01:17 BoogieIcfgContainer [2024-11-10 10:01:17,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:01:17,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:01:17,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:01:17,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:01:17,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:06" (3/4) ... [2024-11-10 10:01:17,958 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 10:01:17,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:01:17,960 INFO L158 Benchmark]: Toolchain (without parser) took 12937.91ms. Allocated memory was 178.3MB in the beginning and 461.4MB in the end (delta: 283.1MB). Free memory was 123.9MB in the beginning and 210.2MB in the end (delta: -86.2MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2024-11-10 10:01:17,960 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:01:17,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.12ms. Allocated memory is still 178.3MB. Free memory was 123.9MB in the beginning and 106.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 10:01:17,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.80ms. Allocated memory is still 178.3MB. Free memory was 106.0MB in the beginning and 102.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:01:17,961 INFO L158 Benchmark]: Boogie Preprocessor took 79.64ms. Allocated memory is still 178.3MB. Free memory was 102.2MB in the beginning and 98.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:01:17,961 INFO L158 Benchmark]: IcfgBuilder took 886.90ms. Allocated memory is still 178.3MB. Free memory was 98.9MB in the beginning and 61.9MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 10:01:17,962 INFO L158 Benchmark]: TraceAbstraction took 11433.73ms. Allocated memory was 178.3MB in the beginning and 461.4MB in the end (delta: 283.1MB). Free memory was 61.5MB in the beginning and 210.2MB in the end (delta: -148.7MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. [2024-11-10 10:01:17,962 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 461.4MB. Free memory is still 210.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:01:17,964 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.12ms. Allocated memory is still 178.3MB. Free memory was 123.9MB in the beginning and 106.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.80ms. Allocated memory is still 178.3MB. Free memory was 106.0MB in the beginning and 102.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.64ms. Allocated memory is still 178.3MB. Free memory was 102.2MB in the beginning and 98.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 886.90ms. Allocated memory is still 178.3MB. Free memory was 98.9MB in the beginning and 61.9MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11433.73ms. Allocated memory was 178.3MB in the beginning and 461.4MB in the end (delta: 283.1MB). Free memory was 61.5MB in the beginning and 210.2MB in the end (delta: -148.7MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 461.4MB. Free memory is still 210.2MB. 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 134, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L62] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L69] float last_1_WrapperStruct00_var_1_12 = 15.75; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_12=63/4] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_12 [L131] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L116] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L126] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L142] RET updateVariables() [L143] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L73] COND FALSE !((*(WrapperStruct00_var_1_6_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L76] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L80] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L81] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] signed long int stepLocal_0 = ((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))); [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L95] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_0 [L96] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] COND TRUE ! (*(WrapperStruct00_var_1_6_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L97] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L102] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L102] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 [L134] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134-L135] return ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 2901 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1977 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1349 IncrementalHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 924 mSDtfsCounter, 1349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 922 ConstructedInterpolants, 0 QuantifiedInterpolants, 5242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2940/2940 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-10 10:01:18,000 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-73.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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:01:20,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:01:20,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 10:01:20,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:01:20,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:01:20,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:01:20,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:01:20,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:01:20,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:01:20,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:01:20,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:01:20,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:01:20,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:01:20,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:01:20,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:01:20,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:01:20,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:01:20,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:01:20,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:01:20,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:01:20,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:01:20,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:01:20,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:01:20,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 10:01:20,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 10:01:20,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:01:20,416 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 10:01:20,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:01:20,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:01:20,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:01:20,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:01:20,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:01:20,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:01:20,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:01:20,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:20,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:01:20,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:01:20,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:01:20,436 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 10:01:20,436 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 10:01:20,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:01:20,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:01:20,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:01:20,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:01:20,438 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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-10 10:01:20,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:01:20,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:01:20,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:01:20,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:01:20,780 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:01:20,781 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-73.i [2024-11-10 10:01:22,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:01:22,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:01:22,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-10 10:01:22,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b72b3f8/d4e175f69a3d40f4a3187c10e56973f1/FLAG540a671e4 [2024-11-10 10:01:22,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b72b3f8/d4e175f69a3d40f4a3187c10e56973f1 [2024-11-10 10:01:22,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:01:22,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:01:22,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:22,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:01:22,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:01:22,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:22" (1/1) ... [2024-11-10 10:01:22,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343bd53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:22, skipping insertion in model container [2024-11-10 10:01:22,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:22" (1/1) ... [2024-11-10 10:01:23,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:01:23,186 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-73.i[917,930] [2024-11-10 10:01:23,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:23,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:01:23,285 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-73.i[917,930] [2024-11-10 10:01:23,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:23,367 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:01:23,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23 WrapperNode [2024-11-10 10:01:23,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:23,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:23,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:01:23,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:01:23,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,451 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-10 10:01:23,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:23,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:01:23,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:01:23,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:01:23,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,521 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-10 10:01:23,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:01:23,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:01:23,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:01:23,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:01:23,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (1/1) ... [2024-11-10 10:01:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:23,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:23,603 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-10 10:01:23,609 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-10 10:01:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:01:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 10:01:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 10:01:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-10 10:01:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-10 10:01:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 10:01:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 10:01:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 10:01:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 10:01:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 10:01:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 10:01:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 10:01:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 10:01:23,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 10:01:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 10:01:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:01:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:01:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-10 10:01:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-10 10:01:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:01:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:01:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 10:01:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 10:01:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 10:01:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 10:01:23,848 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:01:23,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:01:27,320 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2024-11-10 10:01:27,375 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-10 10:01:27,375 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:01:27,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:01:27,407 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:01:27,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:27 BoogieIcfgContainer [2024-11-10 10:01:27,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:01:27,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:01:27,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:01:27,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:01:27,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:01:22" (1/3) ... [2024-11-10 10:01:27,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:27, skipping insertion in model container [2024-11-10 10:01:27,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:23" (2/3) ... [2024-11-10 10:01:27,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:27, skipping insertion in model container [2024-11-10 10:01:27,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:27" (3/3) ... [2024-11-10 10:01:27,418 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-10 10:01:27,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:01:27,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:01:27,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:01:27,507 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;@126bcc9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:01:27,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:01:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 10:01:27,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:27,527 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:27,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:27,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -648079043, now seen corresponding path program 1 times [2024-11-10 10:01:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786455263] [2024-11-10 10:01:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:27,547 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-10 10:01:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:27,549 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-10 10:01:27,550 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-10 10:01:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:27,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 10:01:27,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-10 10:01:28,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:28,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786455263] [2024-11-10 10:01:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786455263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:28,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:28,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:01:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375831817] [2024-11-10 10:01:28,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:01:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:01:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:01:28,045 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:28,080 INFO L93 Difference]: Finished difference Result 218 states and 338 transitions. [2024-11-10 10:01:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:01:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-10 10:01:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:28,092 INFO L225 Difference]: With dead ends: 218 [2024-11-10 10:01:28,093 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 10:01:28,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-10 10:01:28,101 INFO L432 NwaCegarLoop]: 157 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, 157 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-10 10:01:28,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 10:01:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 10:01:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-10 10:01:28,151 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 131 [2024-11-10 10:01:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:28,151 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-10 10:01:28,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-10 10:01:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 10:01:28,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:28,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:28,174 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-10 10:01:28,362 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-10 10:01:28,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:28,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash 733879612, now seen corresponding path program 1 times [2024-11-10 10:01:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151916331] [2024-11-10 10:01:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:28,365 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-10 10:01:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:28,367 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-10 10:01:28,389 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-10 10:01:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:28,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:01:28,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:28,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:28,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:28,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151916331] [2024-11-10 10:01:28,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151916331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498675622] [2024-11-10 10:01:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:28,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:28,827 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:28,902 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-10 10:01:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-10 10:01:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:28,909 INFO L225 Difference]: With dead ends: 215 [2024-11-10 10:01:28,909 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 10:01:28,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:28,911 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:28,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 10:01:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 10:01:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-10 10:01:28,943 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2024-11-10 10:01:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:28,949 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-10 10:01:28,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-10 10:01:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 10:01:28,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:28,956 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:28,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 10:01:29,156 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-10 10:01:29,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:29,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1185973534, now seen corresponding path program 1 times [2024-11-10 10:01:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:29,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958226105] [2024-11-10 10:01:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:29,159 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-10 10:01:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:29,162 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-10 10:01:29,164 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-10 10:01:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:29,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 10:01:29,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:29,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:29,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958226105] [2024-11-10 10:01:29,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958226105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:29,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861047551] [2024-11-10 10:01:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:29,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:01:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:01:29,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:29,645 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:29,714 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-10 10:01:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:01:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-10 10:01:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:29,717 INFO L225 Difference]: With dead ends: 222 [2024-11-10 10:01:29,717 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 10:01:29,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:29,722 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:29,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 10:01:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 10:01:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-10 10:01:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-10 10:01:29,739 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 133 [2024-11-10 10:01:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:29,741 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-10 10:01:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-10 10:01:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 10:01:29,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:29,748 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:29,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 10:01:29,948 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-10 10:01:29,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1366183427, now seen corresponding path program 1 times [2024-11-10 10:01:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806769186] [2024-11-10 10:01:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:29,950 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-10 10:01:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:29,954 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-10 10:01:29,957 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-10 10:01:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:30,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:01:30,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:30,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:30,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806769186] [2024-11-10 10:01:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806769186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:01:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032114673] [2024-11-10 10:01:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:01:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:30,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:01:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:30,425 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:30,506 INFO L93 Difference]: Finished difference Result 228 states and 327 transitions. [2024-11-10 10:01:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-10 10:01:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:30,508 INFO L225 Difference]: With dead ends: 228 [2024-11-10 10:01:30,511 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 10:01:30,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:30,513 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:30,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 734 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 10:01:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 10:01:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-10 10:01:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2024-11-10 10:01:30,528 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 133 [2024-11-10 10:01:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2024-11-10 10:01:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2024-11-10 10:01:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 10:01:30,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:30,533 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:30,547 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 10:01:30,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:01:30,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:30,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1337554276, now seen corresponding path program 1 times [2024-11-10 10:01:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138287192] [2024-11-10 10:01:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:30,736 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-10 10:01:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:30,737 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:01:30,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 10:01:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:31,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 10:01:31,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:31,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-10 10:01:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-10 10:01:31,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:31,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138287192] [2024-11-10 10:01:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138287192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129760599] [2024-11-10 10:01:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:31,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:01:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:31,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:01:31,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:31,345 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:32,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:01:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:35,891 INFO L93 Difference]: Finished difference Result 230 states and 328 transitions. [2024-11-10 10:01:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:01:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-10 10:01:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:35,897 INFO L225 Difference]: With dead ends: 230 [2024-11-10 10:01:35,898 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 10:01:35,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:01:35,899 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 124 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:35,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 446 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 10:01:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 10:01:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-10 10:01:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-10 10:01:35,914 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 133 [2024-11-10 10:01:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:35,914 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-10 10:01:35,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-10 10:01:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 10:01:35,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:35,916 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:35,929 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 (6)] Ended with exit code 0 [2024-11-10 10:01:36,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:01:36,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:36,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1803381474, now seen corresponding path program 1 times [2024-11-10 10:01:36,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:36,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039116280] [2024-11-10 10:01:36,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:36,118 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-10 10:01:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:36,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:01:36,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 10:01:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:36,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 10:01:36,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:36,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-10 10:01:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 10:01:36,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:36,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039116280] [2024-11-10 10:01:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039116280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227816980] [2024-11-10 10:01:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:01:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:01:36,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:36,896 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:37,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:01:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:39,816 INFO L93 Difference]: Finished difference Result 230 states and 326 transitions. [2024-11-10 10:01:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:01:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2024-11-10 10:01:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:39,818 INFO L225 Difference]: With dead ends: 230 [2024-11-10 10:01:39,818 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 10:01:39,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:01:39,819 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 102 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:39,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 442 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 10:01:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 10:01:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-10 10:01:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-10 10:01:39,829 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 135 [2024-11-10 10:01:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:39,829 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-10 10:01:39,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-10 10:01:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 10:01:39,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:39,831 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:39,845 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 (7)] Ended with exit code 0 [2024-11-10 10:01:40,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10 10:01:40,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:40,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash -737362660, now seen corresponding path program 1 times [2024-11-10 10:01:40,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:40,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188794834] [2024-11-10 10:01:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:40,034 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-10 10:01:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:40,035 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10 10:01:40,036 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 (8)] Waiting until timeout for monitored process [2024-11-10 10:01:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:40,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:01:40,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-10 10:01:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:40,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:40,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188794834] [2024-11-10 10:01:40,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188794834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:40,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:40,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406471099] [2024-11-10 10:01:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:40,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:40,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:40,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:40,516 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:41,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:01:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:42,930 INFO L93 Difference]: Finished difference Result 231 states and 326 transitions. [2024-11-10 10:01:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-10 10:01:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:42,932 INFO L225 Difference]: With dead ends: 231 [2024-11-10 10:01:42,932 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 10:01:42,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:42,933 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:42,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 10:01:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 10:01:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-10 10:01:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 165 transitions. [2024-11-10 10:01:42,940 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 165 transitions. Word has length 137 [2024-11-10 10:01:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 165 transitions. [2024-11-10 10:01:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 165 transitions. [2024-11-10 10:01:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 10:01:42,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:42,943 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:42,959 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 (8)] Ended with exit code 0 [2024-11-10 10:01:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-10 10:01:43,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:43,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1519548347, now seen corresponding path program 1 times [2024-11-10 10:01:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109366800] [2024-11-10 10:01:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:43,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:01:43,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:43,146 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10 10:01:43,147 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 (9)] Waiting until timeout for monitored process [2024-11-10 10:01:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:43,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 10:01:43,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:43,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:01:43,787 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 46 treesize of output 34 [2024-11-10 10:01:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:43,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:01:43,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:01:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109366800] [2024-11-10 10:01:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109366800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:43,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894406284] [2024-11-10 10:01:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:01:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:01:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:01:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:43,851 INFO L87 Difference]: Start difference. First operand 118 states and 165 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:45,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:01:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:47,782 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-11-10 10:01:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:01:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-10 10:01:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:47,785 INFO L225 Difference]: With dead ends: 233 [2024-11-10 10:01:47,785 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 10:01:47,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:47,786 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:47,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-10 10:01:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 10:01:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-10 10:01:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-10 10:01:47,792 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 137 [2024-11-10 10:01:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:47,793 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-10 10:01:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-10 10:01:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 10:01:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:47,795 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:01:47,810 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 (9)] Ended with exit code 0 [2024-11-10 10:01:47,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10 10:01:47,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1519377073, now seen corresponding path program 1 times [2024-11-10 10:01:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:01:47,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755738509] [2024-11-10 10:01:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:47,998 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-10 10:01:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:01:48,001 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10 10:01:48,002 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 (10)] Waiting until timeout for monitored process [2024-11-10 10:01:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:48,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 10:01:48,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:48,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:48,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:48,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:48,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:48,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:48,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:01:48,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 61 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 34 [2024-11-10 10:01:49,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-10 10:01:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2024-11-10 10:01:55,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2024-11-10 10:01:56,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2024-11-10 10:01:57,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2024-11-10 10:01:57,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2024-11-10 10:01:58,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2024-11-10 10:01:59,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2024-11-10 10:02:00,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-10 10:02:01,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 92 [2024-11-10 10:02:01,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 91 [2024-11-10 10:02:01,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:02:01,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 46 [2024-11-10 10:02:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 264 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 10:02:01,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:02:02,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:02:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755738509] [2024-11-10 10:02:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755738509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:02:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [874555454] [2024-11-10 10:02:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:02,303 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 10:02:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 10:02:02,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 10:02:02,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-10 10:02:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:03,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 10:02:03,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:02:03,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-10 10:02:04,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-10 10:02:04,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 10:02:05,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 10:02:05,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 10:02:05,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 10:02:06,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 10:02:06,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-10 10:02:07,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-10 10:02:07,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2024-11-10 10:02:08,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2024-11-10 10:02:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 120 proven. 104 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-10 10:02:08,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:02:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [874555454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:02:08,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 10:02:08,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-11-10 10:02:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157622049] [2024-11-10 10:02:08,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 10:02:08,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 10:02:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:02:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 10:02:08,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=755, Unknown=1, NotChecked=0, Total=870 [2024-11-10 10:02:08,943 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 9 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-10 10:02:10,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:02:12,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:02:14,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 10:02:15,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]