./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:52:40,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:52:40,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:52:40,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:52:40,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:52:40,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:52:40,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:52:40,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:52:40,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:52:40,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:52:40,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:52:40,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:52:40,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:52:40,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:52:40,889 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:52:40,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:52:40,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:52:40,891 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:52:40,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:52:40,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:52:40,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:52:40,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:52:40,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:52:40,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:52:40,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:52:40,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:52:40,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:52:40,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:52:40,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:52:40,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:52:40,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:52:40,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:52:40,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:52:40,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:52:40,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:52:40,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:52:40,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:52:40,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:52:40,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:52:40,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:52:40,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:52:40,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:52:40,904 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-11-16 18:52:41,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:52:41,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:52:41,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:52:41,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:52:41,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:52:41,176 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-21.i [2024-11-16 18:52:42,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:52:42,950 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:52:42,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-16 18:52:42,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69105bfd6/9c3c98dcff2d4a34a9dedfcbcb89377c/FLAGce1a2f4c7 [2024-11-16 18:52:42,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69105bfd6/9c3c98dcff2d4a34a9dedfcbcb89377c [2024-11-16 18:52:42,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:52:42,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:52:42,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:52:42,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:52:42,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:52:42,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:52:42" (1/1) ... [2024-11-16 18:52:42,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9da4bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:42, skipping insertion in model container [2024-11-16 18:52:42,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:52:42" (1/1) ... [2024-11-16 18:52:43,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:52:43,183 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-21.i[917,930] [2024-11-16 18:52:43,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:52:43,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:52:43,257 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-21.i[917,930] [2024-11-16 18:52:43,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:52:43,327 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:52:43,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43 WrapperNode [2024-11-16 18:52:43,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:52:43,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:52:43,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:52:43,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:52:43,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,379 INFO L138 Inliner]: procedures = 29, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-16 18:52:43,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:52:43,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:52:43,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:52:43,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:52:43,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,423 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-16 18:52:43,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:52:43,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:52:43,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:52:43,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:52:43,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (1/1) ... [2024-11-16 18:52:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:52:43,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:52:43,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:52:43,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:52:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:52:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:52:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:52:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:52:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:52:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:52:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:52:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:52:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:52:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:52:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:52:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:52:43,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:52:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:52:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:52:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:52:43,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:52:43,693 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:52:43,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:52:44,199 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite75#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short107#1; [2024-11-16 18:52:44,262 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-16 18:52:44,262 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:52:44,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:52:44,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:52:44,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:52:44 BoogieIcfgContainer [2024-11-16 18:52:44,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:52:44,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:52:44,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:52:44,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:52:44,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:52:42" (1/3) ... [2024-11-16 18:52:44,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e5bed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:52:44, skipping insertion in model container [2024-11-16 18:52:44,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:43" (2/3) ... [2024-11-16 18:52:44,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e5bed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:52:44, skipping insertion in model container [2024-11-16 18:52:44,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:52:44" (3/3) ... [2024-11-16 18:52:44,300 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-16 18:52:44,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:52:44,317 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:52:44,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:52:44,405 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;@a708b6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:52:44,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:52:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 18:52:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:52:44,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:44,424 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:44,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1462009709, now seen corresponding path program 1 times [2024-11-16 18:52:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9855699] [2024-11-16 18:52:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9855699] [2024-11-16 18:52:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9855699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:52:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575376452] [2024-11-16 18:52:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:44,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:52:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:52:44,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:52:44,857 INFO L87 Difference]: Start difference. First operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:52:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:44,891 INFO L93 Difference]: Finished difference Result 190 states and 290 transitions. [2024-11-16 18:52:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:52:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-16 18:52:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:44,904 INFO L225 Difference]: With dead ends: 190 [2024-11-16 18:52:44,905 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:52:44,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:52:44,914 INFO L432 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:44,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:52:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:52:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 18:52:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 18:52:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-16 18:52:44,966 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 82 [2024-11-16 18:52:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:44,968 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-16 18:52:44,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:52:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-16 18:52:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:52:44,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:44,973 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:52:44,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:44,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 809860656, now seen corresponding path program 1 times [2024-11-16 18:52:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466357357] [2024-11-16 18:52:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466357357] [2024-11-16 18:52:45,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466357357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:45,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:45,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:52:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847720176] [2024-11-16 18:52:45,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:45,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:52:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:52:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:52:45,244 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:52:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:45,296 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2024-11-16 18:52:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:52:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-16 18:52:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:45,298 INFO L225 Difference]: With dead ends: 187 [2024-11-16 18:52:45,299 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 18:52:45,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-16 18:52:45,300 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 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-16 18:52:45,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:52:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 18:52:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 18:52:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 18:52:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-11-16 18:52:45,311 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 82 [2024-11-16 18:52:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-11-16 18:52:45,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:52:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-11-16 18:52:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:52:45,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:45,320 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:45,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:52:45,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1554487535, now seen corresponding path program 1 times [2024-11-16 18:52:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593568027] [2024-11-16 18:52:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:46,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593568027] [2024-11-16 18:52:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593568027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:46,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:52:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954177528] [2024-11-16 18:52:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:52:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:52:46,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:52:46,128 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:46,531 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2024-11-16 18:52:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:52:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-11-16 18:52:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:46,534 INFO L225 Difference]: With dead ends: 315 [2024-11-16 18:52:46,535 INFO L226 Difference]: Without dead ends: 222 [2024-11-16 18:52:46,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:52:46,536 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 199 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:46,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 628 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:52:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-16 18:52:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2024-11-16 18:52:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 175 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:52:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2024-11-16 18:52:46,570 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 82 [2024-11-16 18:52:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:46,570 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2024-11-16 18:52:46,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2024-11-16 18:52:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 18:52:46,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:46,577 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:46,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:52:46,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:46,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1617162122, now seen corresponding path program 1 times [2024-11-16 18:52:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:46,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510684785] [2024-11-16 18:52:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510684785] [2024-11-16 18:52:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510684785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:52:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982896818] [2024-11-16 18:52:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:46,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:52:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:52:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:52:46,753 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:46,784 INFO L93 Difference]: Finished difference Result 384 states and 555 transitions. [2024-11-16 18:52:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:52:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-11-16 18:52:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:46,787 INFO L225 Difference]: With dead ends: 384 [2024-11-16 18:52:46,788 INFO L226 Difference]: Without dead ends: 195 [2024-11-16 18:52:46,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-16 18:52:46,793 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:46,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:52:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-16 18:52:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-16 18:52:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 178 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:52:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 279 transitions. [2024-11-16 18:52:46,815 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 279 transitions. Word has length 85 [2024-11-16 18:52:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:46,816 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 279 transitions. [2024-11-16 18:52:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 279 transitions. [2024-11-16 18:52:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 18:52:46,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:46,821 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:46,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:52:46,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:46,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1641028383, now seen corresponding path program 1 times [2024-11-16 18:52:46,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:46,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256853639] [2024-11-16 18:52:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256853639] [2024-11-16 18:52:48,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256853639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:48,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:48,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:52:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641049305] [2024-11-16 18:52:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:52:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:52:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:52:48,065 INFO L87 Difference]: Start difference. First operand 195 states and 279 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 18:52:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:48,828 INFO L93 Difference]: Finished difference Result 432 states and 610 transitions. [2024-11-16 18:52:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:52:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 89 [2024-11-16 18:52:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:48,831 INFO L225 Difference]: With dead ends: 432 [2024-11-16 18:52:48,831 INFO L226 Difference]: Without dead ends: 336 [2024-11-16 18:52:48,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-16 18:52:48,832 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 412 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:48,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1010 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:52:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-16 18:52:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 309. [2024-11-16 18:52:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 284 states have (on average 1.4014084507042253) internal successors, (398), 286 states have internal predecessors, (398), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 18:52:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 438 transitions. [2024-11-16 18:52:48,854 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 438 transitions. Word has length 89 [2024-11-16 18:52:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:48,854 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 438 transitions. [2024-11-16 18:52:48,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 18:52:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 438 transitions. [2024-11-16 18:52:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 18:52:48,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:48,856 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:52:48,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 174136704, now seen corresponding path program 1 times [2024-11-16 18:52:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424038366] [2024-11-16 18:52:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424038366] [2024-11-16 18:52:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424038366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:50,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:50,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:52:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235315509] [2024-11-16 18:52:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:52:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:50,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:52:50,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:52:50,118 INFO L87 Difference]: Start difference. First operand 309 states and 438 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 18:52:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:50,500 INFO L93 Difference]: Finished difference Result 568 states and 800 transitions. [2024-11-16 18:52:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:52:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 90 [2024-11-16 18:52:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:50,505 INFO L225 Difference]: With dead ends: 568 [2024-11-16 18:52:50,506 INFO L226 Difference]: Without dead ends: 390 [2024-11-16 18:52:50,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:52:50,508 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:50,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 640 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:52:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-16 18:52:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 329. [2024-11-16 18:52:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 304 states have (on average 1.394736842105263) internal successors, (424), 306 states have internal predecessors, (424), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 18:52:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 464 transitions. [2024-11-16 18:52:50,534 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 464 transitions. Word has length 90 [2024-11-16 18:52:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:50,534 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 464 transitions. [2024-11-16 18:52:50,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 18:52:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 464 transitions. [2024-11-16 18:52:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 18:52:50,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:50,536 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:50,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:52:50,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:50,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1944191905, now seen corresponding path program 1 times [2024-11-16 18:52:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:50,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665958271] [2024-11-16 18:52:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665958271] [2024-11-16 18:52:50,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665958271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:50,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:52:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868751965] [2024-11-16 18:52:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:52:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:52:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:52:50,752 INFO L87 Difference]: Start difference. First operand 329 states and 464 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:50,994 INFO L93 Difference]: Finished difference Result 698 states and 976 transitions. [2024-11-16 18:52:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:52:50,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2024-11-16 18:52:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:50,999 INFO L225 Difference]: With dead ends: 698 [2024-11-16 18:52:50,999 INFO L226 Difference]: Without dead ends: 397 [2024-11-16 18:52:51,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:52:51,001 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 192 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:51,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 456 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:52:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-16 18:52:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 331. [2024-11-16 18:52:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 306 states have (on average 1.3790849673202614) internal successors, (422), 308 states have internal predecessors, (422), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 18:52:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 462 transitions. [2024-11-16 18:52:51,033 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 462 transitions. Word has length 91 [2024-11-16 18:52:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:51,034 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 462 transitions. [2024-11-16 18:52:51,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 462 transitions. [2024-11-16 18:52:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 18:52:51,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:51,036 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:52:51,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1099720034, now seen corresponding path program 1 times [2024-11-16 18:52:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328734836] [2024-11-16 18:52:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328734836] [2024-11-16 18:52:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328734836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:52:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523738607] [2024-11-16 18:52:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:51,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:52:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:51,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:52:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:52:51,643 INFO L87 Difference]: Start difference. First operand 331 states and 462 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:52:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:52,048 INFO L93 Difference]: Finished difference Result 712 states and 987 transitions. [2024-11-16 18:52:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:52:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2024-11-16 18:52:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:52,052 INFO L225 Difference]: With dead ends: 712 [2024-11-16 18:52:52,052 INFO L226 Difference]: Without dead ends: 409 [2024-11-16 18:52:52,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:52:52,054 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 205 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:52,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 826 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:52:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-16 18:52:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 334. [2024-11-16 18:52:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 311 states have internal predecessors, (425), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 18:52:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2024-11-16 18:52:52,082 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 465 transitions. Word has length 91 [2024-11-16 18:52:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 465 transitions. [2024-11-16 18:52:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:52:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2024-11-16 18:52:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 18:52:52,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:52,084 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:52:52,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1450707480, now seen corresponding path program 1 times [2024-11-16 18:52:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594290119] [2024-11-16 18:52:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:52:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:52:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:52:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:52:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:52:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:52:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:52:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:52:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:52:52,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:52:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594290119] [2024-11-16 18:52:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594290119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:52:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:52:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:52:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961284723] [2024-11-16 18:52:52,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:52:52,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:52:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:52:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:52:52,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:52:52,299 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:52:52,354 INFO L93 Difference]: Finished difference Result 349 states and 482 transitions. [2024-11-16 18:52:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:52:52,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2024-11-16 18:52:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:52:52,357 INFO L225 Difference]: With dead ends: 349 [2024-11-16 18:52:52,357 INFO L226 Difference]: Without dead ends: 346 [2024-11-16 18:52:52,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:52:52,358 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:52:52,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:52:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-16 18:52:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-16 18:52:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 321 states have (on average 1.3613707165109035) internal successors, (437), 323 states have internal predecessors, (437), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 18:52:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 477 transitions. [2024-11-16 18:52:52,380 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 477 transitions. Word has length 91 [2024-11-16 18:52:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:52:52,381 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 477 transitions. [2024-11-16 18:52:52,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:52:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 477 transitions. [2024-11-16 18:52:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 18:52:52,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:52:52,382 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:52,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:52:52,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:52:52,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:52:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash 166089603, now seen corresponding path program 1 times [2024-11-16 18:52:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:52:52,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875172161] [2024-11-16 18:52:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:52:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:52:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354502162] [2024-11-16 18:52:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:52:52,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:52:52,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:52:52,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:52:52,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:52:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:52:52,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:52:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:52:52,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:52:52,781 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:52:52,782 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:52:52,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:52:52,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 18:52:52,988 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:52:53,082 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:52:53,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:52:53 BoogieIcfgContainer [2024-11-16 18:52:53,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:52:53,090 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:52:53,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:52:53,090 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:52:53,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:52:44" (3/4) ... [2024-11-16 18:52:53,093 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:52:53,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:52:53,095 INFO L158 Benchmark]: Toolchain (without parser) took 10111.31ms. Allocated memory was 167.8MB in the beginning and 339.7MB in the end (delta: 172.0MB). Free memory was 112.0MB in the beginning and 231.2MB in the end (delta: -119.2MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,095 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:52:53,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.60ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 95.8MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.39ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 92.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,096 INFO L158 Benchmark]: Boogie Preprocessor took 65.42ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 88.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,096 INFO L158 Benchmark]: IcfgBuilder took 840.64ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 88.5MB in the beginning and 196.1MB in the end (delta: -107.6MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,096 INFO L158 Benchmark]: TraceAbstraction took 8799.05ms. Allocated memory was 234.9MB in the beginning and 339.7MB in the end (delta: 104.9MB). Free memory was 195.0MB in the beginning and 232.3MB in the end (delta: -37.2MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,097 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 339.7MB. Free memory was 232.3MB in the beginning and 231.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:52:53,098 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 167.8MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.60ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 95.8MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.39ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 92.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.42ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 88.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 840.64ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 88.5MB in the beginning and 196.1MB in the end (delta: -107.6MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8799.05ms. Allocated memory was 234.9MB in the beginning and 339.7MB in the end (delta: 104.9MB). Free memory was 195.0MB in the beginning and 232.3MB in the end (delta: -37.2MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 339.7MB. Free memory was 232.3MB in the beginning and 231.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L45] unsigned short int* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L47] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L48] double* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L49] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L50] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] signed short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] float* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] float* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] unsigned char last_1_WrapperStruct0_var_1_7 = 0; [L55] signed short int last_1_WrapperStruct0_var_1_13 = 256; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=0, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L99] EXPR WrapperStruct0.var_1_7 [L99] last_1_WrapperStruct0_var_1_7 = WrapperStruct0.var_1_7 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L84] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L86] WrapperStruct0.var_1_9 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L88] WrapperStruct0.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L90] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L93] WrapperStruct0.var_1_14 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L95] WrapperStruct0.var_1_15 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L111] RET updateVariables() [L112] CALL step() [L59] COND TRUE (last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L60] COND FALSE !(last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L69] COND FALSE !(((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) [L72] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L72] (*(WrapperStruct0_var_1_13_Pointer)) = (*(WrapperStruct0_var_1_1_Pointer)) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] COND TRUE (((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer)) [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] COND FALSE !(last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) [L103] EXPR \read(*WrapperStruct0_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103-L104] return ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1311 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1307 mSDsluCounter, 5514 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4358 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2002 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 1156 mSDtfsCounter, 2002 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 259 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 967 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 3978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 756/756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:52:53,135 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-21.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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:52:55,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:52:55,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:52:55,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:52:55,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:52:55,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:52:55,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:52:55,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:52:55,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:52:55,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:52:55,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:52:55,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:52:55,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:52:55,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:52:55,394 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:52:55,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:52:55,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:52:55,396 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:52:55,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:52:55,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:52:55,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:52:55,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:52:55,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:52:55,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:52:55,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:52:55,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:52:55,400 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:52:55,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:52:55,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:52:55,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:52:55,401 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:52:55,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:52:55,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:52:55,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:52:55,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:52:55,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:52:55,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:52:55,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:52:55,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:52:55,405 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:52:55,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:52:55,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:52:55,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:52:55,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:52:55,406 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-11-16 18:52:55,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:52:55,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:52:55,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:52:55,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:52:55,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:52:55,767 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-21.i [2024-11-16 18:52:57,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:52:57,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:52:57,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-16 18:52:57,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20f2a3ca/5501ebea29104ba4af7a912f68e66198/FLAGf283a8815 [2024-11-16 18:52:57,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20f2a3ca/5501ebea29104ba4af7a912f68e66198 [2024-11-16 18:52:57,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:52:57,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:52:57,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:52:57,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:52:57,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:52:57,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:57,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53395935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57, skipping insertion in model container [2024-11-16 18:52:57,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:57,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:52:57,735 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-21.i[917,930] [2024-11-16 18:52:57,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:52:57,832 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:52:57,844 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-21.i[917,930] [2024-11-16 18:52:57,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:52:57,917 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:52:57,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57 WrapperNode [2024-11-16 18:52:57,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:52:57,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:52:57,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:52:57,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:52:57,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:57,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:57,982 INFO L138 Inliner]: procedures = 36, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-16 18:52:57,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:52:57,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:52:57,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:52:57,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:52:58,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,036 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-16 18:52:58,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:52:58,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:52:58,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:52:58,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:52:58,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (1/1) ... [2024-11-16 18:52:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:52:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:52:58,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:52:58,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:52:58,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:52:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-16 18:52:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-16 18:52:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 18:52:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:52:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:52:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:52:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-16 18:52:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-16 18:52:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:52:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:52:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:52:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:52:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 18:52:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 18:52:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:52:58,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:52:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:52:58,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:52:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:52:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:52:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:52:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:52:58,329 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:52:58,334 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:53:07,349 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite75#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short107#1; [2024-11-16 18:53:07,384 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-16 18:53:07,385 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:53:07,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:53:07,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:53:07,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:53:07 BoogieIcfgContainer [2024-11-16 18:53:07,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:53:07,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:53:07,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:53:07,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:53:07,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:52:57" (1/3) ... [2024-11-16 18:53:07,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c63827a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:53:07, skipping insertion in model container [2024-11-16 18:53:07,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:52:57" (2/3) ... [2024-11-16 18:53:07,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c63827a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:53:07, skipping insertion in model container [2024-11-16 18:53:07,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:53:07" (3/3) ... [2024-11-16 18:53:07,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-16 18:53:07,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:53:07,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:53:07,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:53:07,510 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;@433e40ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:53:07,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:53:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 18:53:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:53:07,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:07,530 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:07,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1462009709, now seen corresponding path program 1 times [2024-11-16 18:53:07,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:07,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567427624] [2024-11-16 18:53:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:07,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:07,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:53:07,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:53:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:07,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:53:07,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-16 18:53:07,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:53:07,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:07,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567427624] [2024-11-16 18:53:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567427624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:53:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:53:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:53:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228301637] [2024-11-16 18:53:07,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:53:07,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:53:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:07,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:53:07,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:53:07,988 INFO L87 Difference]: Start difference. First operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:53:08,013 INFO L93 Difference]: Finished difference Result 190 states and 290 transitions. [2024-11-16 18:53:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:53:08,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-16 18:53:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:53:08,025 INFO L225 Difference]: With dead ends: 190 [2024-11-16 18:53:08,025 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:53:08,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:53:08,035 INFO L432 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:53:08,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:53:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:53:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 18:53:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 18:53:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-16 18:53:08,082 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 82 [2024-11-16 18:53:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:53:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-16 18:53:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-16 18:53:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:53:08,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:08,087 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:08,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:53:08,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:08,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 809860656, now seen corresponding path program 1 times [2024-11-16 18:53:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625835797] [2024-11-16 18:53:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:08,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:53:08,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:53:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:08,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:53:08,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 18:53:08,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:53:08,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:08,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625835797] [2024-11-16 18:53:08,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625835797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:53:08,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:53:08,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:53:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476594392] [2024-11-16 18:53:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:53:08,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:53:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:53:08,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:53:08,698 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:53:08,797 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2024-11-16 18:53:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:53:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-16 18:53:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:53:08,800 INFO L225 Difference]: With dead ends: 187 [2024-11-16 18:53:08,801 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 18:53:08,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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-16 18:53:08,803 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:53:08,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:53:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 18:53:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 18:53:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 18:53:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-11-16 18:53:08,814 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 82 [2024-11-16 18:53:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:53:08,815 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-11-16 18:53:08,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-11-16 18:53:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:53:08,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:08,818 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:08,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:53:09,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:09,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1554487535, now seen corresponding path program 1 times [2024-11-16 18:53:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:09,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46899154] [2024-11-16 18:53:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:09,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:09,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:09,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:53:09,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:53:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:09,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:53:09,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:09,397 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 21 treesize of output 9 [2024-11-16 18:53:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:53:09,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:53:09,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46899154] [2024-11-16 18:53:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46899154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:53:09,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:53:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:53:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536077704] [2024-11-16 18:53:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:53:09,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:53:09,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:09,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:53:09,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:53:09,666 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:53:10,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:13,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:19,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:23,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:24,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:27,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:53:27,415 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2024-11-16 18:53:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:53:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-11-16 18:53:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:53:27,418 INFO L225 Difference]: With dead ends: 315 [2024-11-16 18:53:27,418 INFO L226 Difference]: Without dead ends: 222 [2024-11-16 18:53:27,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:53:27,420 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 196 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:53:27,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 317 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2024-11-16 18:53:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-16 18:53:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2024-11-16 18:53:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 175 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:53:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2024-11-16 18:53:27,438 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 82 [2024-11-16 18:53:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:53:27,439 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2024-11-16 18:53:27,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:53:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2024-11-16 18:53:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 18:53:27,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:27,441 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:27,453 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-16 18:53:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:27,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:27,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1617162122, now seen corresponding path program 1 times [2024-11-16 18:53:27,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:27,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745157009] [2024-11-16 18:53:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:27,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:27,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:53:27,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:53:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:27,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:53:27,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:53:27,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:53:27,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745157009] [2024-11-16 18:53:27,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745157009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:53:27,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:53:27,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:53:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147372244] [2024-11-16 18:53:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:53:27,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:53:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:27,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:53:27,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:53:27,961 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:53:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:53:28,066 INFO L93 Difference]: Finished difference Result 384 states and 555 transitions. [2024-11-16 18:53:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:53:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-11-16 18:53:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:53:28,068 INFO L225 Difference]: With dead ends: 384 [2024-11-16 18:53:28,069 INFO L226 Difference]: Without dead ends: 195 [2024-11-16 18:53:28,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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-16 18:53:28,071 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:53:28,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:53:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-16 18:53:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-16 18:53:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 178 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:53:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 279 transitions. [2024-11-16 18:53:28,085 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 279 transitions. Word has length 85 [2024-11-16 18:53:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:53:28,086 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 279 transitions. [2024-11-16 18:53:28,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-16 18:53:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 279 transitions. [2024-11-16 18:53:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 18:53:28,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:28,088 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:28,099 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 (5)] Ended with exit code 0 [2024-11-16 18:53:28,288 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-16 18:53:28,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:28,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1641028383, now seen corresponding path program 1 times [2024-11-16 18:53:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:28,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406542318] [2024-11-16 18:53:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:28,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:28,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:28,294 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-16 18:53:28,295 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-16 18:53:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:28,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:53:28,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:28,865 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-16 18:53:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 18:53:28,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:53:28,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:28,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406542318] [2024-11-16 18:53:28,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406542318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:53:28,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:53:28,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:53:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092175813] [2024-11-16 18:53:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:53:28,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:53:28,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:28,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:53:28,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:53:28,933 INFO L87 Difference]: Start difference. First operand 195 states and 279 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:30,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:32,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:35,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:36,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:53:36,786 INFO L93 Difference]: Finished difference Result 389 states and 557 transitions. [2024-11-16 18:53:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:53:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-16 18:53:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:53:36,788 INFO L225 Difference]: With dead ends: 389 [2024-11-16 18:53:36,788 INFO L226 Difference]: Without dead ends: 197 [2024-11-16 18:53:36,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:53:36,790 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:53:36,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 394 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-16 18:53:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-16 18:53:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-16 18:53:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.398876404494382) internal successors, (249), 178 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:53:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-16 18:53:36,812 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 89 [2024-11-16 18:53:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:53:36,813 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-16 18:53:36,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-16 18:53:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 18:53:36,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:36,815 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:36,827 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-16 18:53:37,015 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-16 18:53:37,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1421233375, now seen corresponding path program 1 times [2024-11-16 18:53:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727618341] [2024-11-16 18:53:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:37,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:37,018 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-16 18:53:37,019 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-16 18:53:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:37,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:53:37,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:37,700 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-16 18:53:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 18:53:37,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:53:37,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727618341] [2024-11-16 18:53:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727618341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:53:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:53:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:53:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632201799] [2024-11-16 18:53:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:53:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:53:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:53:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:53:37,766 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:39,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:41,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:43,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:45,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:53:45,928 INFO L93 Difference]: Finished difference Result 389 states and 553 transitions. [2024-11-16 18:53:45,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:53:45,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2024-11-16 18:53:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:53:45,930 INFO L225 Difference]: With dead ends: 389 [2024-11-16 18:53:45,930 INFO L226 Difference]: Without dead ends: 197 [2024-11-16 18:53:45,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:53:45,933 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 95 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:53:45,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 389 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-16 18:53:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-16 18:53:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-16 18:53:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 178 states have internal predecessors, (247), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:53:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 275 transitions. [2024-11-16 18:53:45,958 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 275 transitions. Word has length 91 [2024-11-16 18:53:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:53:45,959 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 275 transitions. [2024-11-16 18:53:45,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 18:53:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 275 transitions. [2024-11-16 18:53:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 18:53:45,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:53:45,964 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:53:45,979 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-16 18:53:46,165 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-16 18:53:46,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:53:46,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:53:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash -176202849, now seen corresponding path program 1 times [2024-11-16 18:53:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:53:46,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655394057] [2024-11-16 18:53:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:46,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:53:46,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:53:46,168 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-16 18:53:46,169 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-16 18:53:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:46,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 18:53:46,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:47,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:53:47,921 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 34 treesize of output 18 [2024-11-16 18:53:48,252 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 34 treesize of output 18 [2024-11-16 18:53:48,523 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 27 treesize of output 15 [2024-11-16 18:53:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 18:53:48,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:53:48,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:53:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655394057] [2024-11-16 18:53:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655394057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:53:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931584041] [2024-11-16 18:53:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:53:48,851 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:53:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:53:48,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:53:48,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-16 18:53:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:53:50,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 18:53:50,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:53:51,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:53:51,861 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 34 treesize of output 18 [2024-11-16 18:53:52,112 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 34 treesize of output 18 [2024-11-16 18:53:52,420 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 27 treesize of output 15 [2024-11-16 18:53:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 18:53:52,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:53:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [931584041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:53:52,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:53:52,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-16 18:53:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312938419] [2024-11-16 18:53:52,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:53:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 18:53:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:53:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 18:53:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-11-16 18:53:52,714 INFO L87 Difference]: Start difference. First operand 195 states and 275 transitions. Second operand has 23 states, 19 states have (on average 6.526315789473684) internal successors, (124), 20 states have internal predecessors, (124), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-16 18:53:55,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:53:57,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:54:00,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:54:02,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:54:04,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:54:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:04,773 INFO L93 Difference]: Finished difference Result 377 states and 523 transitions. [2024-11-16 18:54:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 18:54:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.526315789473684) internal successors, (124), 20 states have internal predecessors, (124), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Word has length 93 [2024-11-16 18:54:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:04,776 INFO L225 Difference]: With dead ends: 377 [2024-11-16 18:54:04,776 INFO L226 Difference]: Without dead ends: 185 [2024-11-16 18:54:04,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2024-11-16 18:54:04,778 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 345 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:54:04,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 656 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2024-11-16 18:54:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-16 18:54:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-16 18:54:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 161 states have internal predecessors, (216), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:54:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2024-11-16 18:54:04,790 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 93 [2024-11-16 18:54:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:04,791 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2024-11-16 18:54:04,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.526315789473684) internal successors, (124), 20 states have internal predecessors, (124), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-16 18:54:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2024-11-16 18:54:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:54:04,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:04,792 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:54:04,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-16 18:54:05,003 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 (8)] Forceful destruction successful, exit code 0 [2024-11-16 18:54:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 18:54:05,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -325456640, now seen corresponding path program 1 times [2024-11-16 18:54:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:54:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14308657] [2024-11-16 18:54:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:05,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:54:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:54:05,196 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-16 18:54:05,196 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-16 18:54:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:05,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 18:54:05,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:54:06,890 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 8 treesize of output 1 [2024-11-16 18:54:07,656 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 34 treesize of output 18 [2024-11-16 18:54:08,121 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 34 treesize of output 18 [2024-11-16 18:54:08,715 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 34 treesize of output 18