./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-p_file-47.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 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:57:01,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:57:01,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:57:01,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:57:01,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:57:01,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:57:01,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:57:01,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:57:01,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:57:01,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:57:01,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:57:01,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:57:01,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:57:01,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:57:01,254 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:57:01,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:57:01,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:57:01,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:57:01,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:57:01,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:57:01,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:57:01,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:57:01,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:57:01,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:57:01,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:57:01,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:57:01,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:57:01,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:57:01,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:57:01,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:57:01,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:57:01,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:57:01,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:57:01,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:57:01,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:57:01,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:57:01,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:57:01,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:57:01,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:57:01,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:57:01,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:57:01,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:57:01,264 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2024-11-19 00:57:01,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:57:01,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:57:01,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:57:01,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:57:01,538 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:57:01,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-19 00:57:02,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:57:03,103 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:57:03,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-19 00:57:03,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945f2790a/513907fbef604de6bbb121518fbf28ad/FLAG8ec11eda7 [2024-11-19 00:57:03,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945f2790a/513907fbef604de6bbb121518fbf28ad [2024-11-19 00:57:03,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:57:03,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:57:03,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:57:03,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:57:03,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:57:03,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a18d3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03, skipping insertion in model container [2024-11-19 00:57:03,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:57:03,376 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-p_file-47.i[916,929] [2024-11-19 00:57:03,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:57:03,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:57:03,457 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-p_file-47.i[916,929] [2024-11-19 00:57:03,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:57:03,499 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:57:03,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03 WrapperNode [2024-11-19 00:57:03,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:57:03,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:57:03,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:57:03,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:57:03,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,595 INFO L138 Inliner]: procedures = 29, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-19 00:57:03,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:57:03,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:57:03,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:57:03,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:57:03,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,644 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2024-11-19 00:57:03,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:57:03,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:57:03,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:57:03,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:57:03,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (1/1) ... [2024-11-19 00:57:03,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:57:03,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:57:03,711 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-19 00:57:03,714 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-19 00:57:03,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:57:03,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:57:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:57:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:57:03,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:57:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:57:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:57:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:57:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:57:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:57:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:57:03,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:57:03,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:57:04,240 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-19 00:57:04,240 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:57:04,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:57:04,258 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:57:04,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:04 BoogieIcfgContainer [2024-11-19 00:57:04,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:57:04,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:57:04,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:57:04,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:57:04,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:57:03" (1/3) ... [2024-11-19 00:57:04,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4398d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:57:04, skipping insertion in model container [2024-11-19 00:57:04,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:03" (2/3) ... [2024-11-19 00:57:04,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4398d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:57:04, skipping insertion in model container [2024-11-19 00:57:04,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:04" (3/3) ... [2024-11-19 00:57:04,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2024-11-19 00:57:04,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:57:04,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:57:04,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:57:04,341 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;@5615aecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:57:04,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:57:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:04,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:04,356 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:04,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-19 00:57:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:57:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549911461] [2024-11-19 00:57:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:57:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 00:57:04,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:57:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549911461] [2024-11-19 00:57:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549911461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:04,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114022350] [2024-11-19 00:57:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:04,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:57:04,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:57:04,617 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-19 00:57:04,618 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-19 00:57:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:04,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:57:04,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 00:57:04,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:04,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114022350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:04,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:04,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:57:04,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143060500] [2024-11-19 00:57:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:04,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:57:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:57:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:57:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:57:04,888 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:57:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:04,907 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-19 00:57:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:57:04,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-19 00:57:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:04,914 INFO L225 Difference]: With dead ends: 185 [2024-11-19 00:57:04,914 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 00:57:04,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-19 00:57:04,919 INFO L432 NwaCegarLoop]: 134 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, 134 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-19 00:57:04,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 00:57:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 00:57:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 00:57:04,978 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-19 00:57:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:04,978 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 00:57:04,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:57:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 00:57:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:04,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:04,987 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:05,005 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-19 00:57:05,191 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,SelfDestructingSolverStorable0 [2024-11-19 00:57:05,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-19 00:57:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:57:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614068976] [2024-11-19 00:57:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:57:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:57:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614068976] [2024-11-19 00:57:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614068976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:57:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797346226] [2024-11-19 00:57:05,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:05,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:57:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:57:05,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:57:05,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:57:05,340 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:05,365 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-19 00:57:05,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:57:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:05,367 INFO L225 Difference]: With dead ends: 182 [2024-11-19 00:57:05,367 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 00:57:05,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:57:05,370 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:05,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 00:57:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-19 00:57:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-19 00:57:05,382 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-19 00:57:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:05,383 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-19 00:57:05,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-19 00:57:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:05,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:05,384 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:05,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:57:05,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:05,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-19 00:57:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:57:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825845124] [2024-11-19 00:57:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:57:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:57:05,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:57:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825845124] [2024-11-19 00:57:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825845124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842938000] [2024-11-19 00:57:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:05,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:57:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:57:05,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:57:05,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:57:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:05,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:57:05,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:05,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:05,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842938000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:05,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 00:57:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325030420] [2024-11-19 00:57:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:05,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:57:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:57:05,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:57:05,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:57:05,987 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:06,015 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 00:57:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:57:06,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:06,020 INFO L225 Difference]: With dead ends: 186 [2024-11-19 00:57:06,020 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:57:06,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:57:06,021 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:06,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:57:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-19 00:57:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-19 00:57:06,035 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2024-11-19 00:57:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:06,035 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-19 00:57:06,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-19 00:57:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:06,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:06,039 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:06,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:57:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:57:06,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:06,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1179868984, now seen corresponding path program 1 times [2024-11-19 00:57:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:57:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709146715] [2024-11-19 00:57:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:57:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:57:06,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:57:06,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709146715] [2024-11-19 00:57:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709146715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:06,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594429049] [2024-11-19 00:57:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:06,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:57:06,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:57:06,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:57:06,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:57:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:06,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:57:06,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:06,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 21 treesize of output 13 [2024-11-19 00:57:06,706 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 31 treesize of output 15 [2024-11-19 00:57:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:06,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594429049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-19 00:57:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536870095] [2024-11-19 00:57:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:06,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:57:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:57:06,754 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:06,949 INFO L93 Difference]: Finished difference Result 279 states and 405 transitions. [2024-11-19 00:57:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:57:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:06,951 INFO L225 Difference]: With dead ends: 279 [2024-11-19 00:57:06,951 INFO L226 Difference]: Without dead ends: 187 [2024-11-19 00:57:06,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:57:06,952 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 124 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:06,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 587 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:57:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-19 00:57:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2024-11-19 00:57:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.411764705882353) internal successors, (216), 153 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:57:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2024-11-19 00:57:06,964 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 84 [2024-11-19 00:57:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:06,965 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2024-11-19 00:57:06,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2024-11-19 00:57:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:06,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:06,966 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:06,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:57:07,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:57:07,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-19 00:57:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:57:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823540940] [2024-11-19 00:57:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:57:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:57:07,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:57:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:57:07,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:57:07,356 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:57:07,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:57:07,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:57:07,365 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 00:57:07,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:57:07,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:57:07 BoogieIcfgContainer [2024-11-19 00:57:07,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:57:07,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:57:07,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:57:07,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:57:07,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:04" (3/4) ... [2024-11-19 00:57:07,503 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:57:07,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:57:07,504 INFO L158 Benchmark]: Toolchain (without parser) took 4366.88ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 106.0MB in the beginning and 89.4MB in the end (delta: 16.6MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. [2024-11-19 00:57:07,504 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:57:07,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.46ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 90.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:57:07,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.89ms. Allocated memory is still 176.2MB. Free memory was 90.6MB in the beginning and 144.4MB in the end (delta: -53.8MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-19 00:57:07,505 INFO L158 Benchmark]: Boogie Preprocessor took 85.24ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 140.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:57:07,505 INFO L158 Benchmark]: RCFGBuilder took 572.23ms. Allocated memory is still 176.2MB. Free memory was 140.2MB in the beginning and 103.3MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 00:57:07,505 INFO L158 Benchmark]: TraceAbstraction took 3239.84ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 103.3MB in the beginning and 89.4MB in the end (delta: 13.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2024-11-19 00:57:07,505 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 272.6MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:57:07,506 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 176.2MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.46ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 90.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.89ms. Allocated memory is still 176.2MB. Free memory was 90.6MB in the beginning and 144.4MB in the end (delta: -53.8MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.24ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 140.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 572.23ms. Allocated memory is still 176.2MB. Free memory was 140.2MB in the beginning and 103.3MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3239.84ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 103.3MB in the beginning and 89.4MB in the end (delta: 13.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 272.6MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L22] double var_1_1 = 24.575; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] double var_1_8 = 3.5; [L24] double var_1_8 = 3.5; [L25] double* var_1_8_Pointer = &(var_1_8); [L26] signed char var_1_9 = 16; [L26] signed char var_1_9 = 16; [L27] signed char* var_1_9_Pointer = &(var_1_9); [L28] signed char var_1_10 = 16; [L28] signed char var_1_10 = 16; [L29] signed char* var_1_10_Pointer = &(var_1_10); [L30] signed char var_1_11 = 4; [L30] signed char var_1_11 = 4; [L31] signed char* var_1_11_Pointer = &(var_1_11); [L32] signed long int var_1_12 = 8; [L32] signed long int var_1_12 = 8; [L33] signed long int* var_1_12_Pointer = &(var_1_12); [L34] unsigned char var_1_13 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char* var_1_13_Pointer = &(var_1_13); [L36] unsigned char var_1_14 = 1; [L36] unsigned char var_1_14 = 1; [L37] unsigned char* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 3.8; [L38] double var_1_15 = 3.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed long int last_1_var_1_12 = 8; VAL [isInitial=0, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L87] EXPR \read(var_1_12) [L87] last_1_var_1_12 = var_1_12 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L71] var_1_8 = __VERIFIER_nondet_double() [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] var_1_11 = __VERIFIER_nondet_char() [L77] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L98] RET updateVariables() [L99] CALL step() [L44] COND FALSE !(-4 > last_1_var_1_12) [L49] EXPR \read(*var_1_10_Pointer) [L49] (*(var_1_9_Pointer)) = (*(var_1_10_Pointer)) [L51] EXPR \read(*var_1_13_Pointer) [L51] unsigned char stepLocal_0 = ! (*(var_1_13_Pointer)); [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] stepLocal_0 || (*(var_1_14_Pointer)) [L52] EXPR \read(*var_1_14_Pointer) [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] COND FALSE !(stepLocal_0 || (*(var_1_14_Pointer))) [L59] EXPR \read(*var_1_8_Pointer) [L59] (*(var_1_15_Pointer)) = (*(var_1_8_Pointer)) [L60] EXPR \read(*var_1_15_Pointer) [L60] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L60] COND FALSE !((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] COND TRUE (*(var_1_12_Pointer)) > (*(var_1_9_Pointer)) [L66] EXPR \read(*var_1_8_Pointer) [L66] (*(var_1_1_Pointer)) = (*(var_1_8_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_15_Pointer) [L90] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90-L91] return (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 574 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1163 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 974/1008 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-19 00:57:07,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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-p_file-47.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 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:57:09,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:57:09,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:57:09,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:57:09,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:57:09,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:57:09,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:57:09,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:57:09,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:57:09,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:57:09,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:57:09,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:57:09,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:57:09,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:57:09,732 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:57:09,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:57:09,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:57:09,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:57:09,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:57:09,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:57:09,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:57:09,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:57:09,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:57:09,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:57:09,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:57:09,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:57:09,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:57:09,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:57:09,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:57:09,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:57:09,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:57:09,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:57:09,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:57:09,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:57:09,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:57:09,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:57:09,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:57:09,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:57:09,737 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:57:09,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:57:09,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:57:09,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:57:09,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:57:09,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:57:09,742 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2024-11-19 00:57:09,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:57:10,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:57:10,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:57:10,027 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:57:10,027 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:57:10,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-19 00:57:11,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:57:11,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:57:11,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2024-11-19 00:57:11,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed090953/eb5a710480c24e9f92f81ddb20a02ffa/FLAGcc82fc096 [2024-11-19 00:57:11,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed090953/eb5a710480c24e9f92f81ddb20a02ffa [2024-11-19 00:57:11,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:57:11,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:57:11,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:57:11,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:57:11,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:57:11,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:57:11" (1/1) ... [2024-11-19 00:57:11,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7464d332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:11, skipping insertion in model container [2024-11-19 00:57:11,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:57:11" (1/1) ... [2024-11-19 00:57:11,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:57:12,067 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-p_file-47.i[916,929] [2024-11-19 00:57:12,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:57:12,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:57:12,118 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-p_file-47.i[916,929] [2024-11-19 00:57:12,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:57:12,162 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:57:12,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12 WrapperNode [2024-11-19 00:57:12,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:57:12,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:57:12,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:57:12,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:57:12,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,203 INFO L138 Inliner]: procedures = 33, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-19 00:57:12,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:57:12,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:57:12,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:57:12,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:57:12,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,234 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2024-11-19 00:57:12,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:57:12,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:57:12,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:57:12,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:57:12,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (1/1) ... [2024-11-19 00:57:12,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:57:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:57:12,289 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-19 00:57:12,294 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-19 00:57:12,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:57:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:57:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:57:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:57:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:57:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:57:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:57:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 00:57:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-19 00:57:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-19 00:57:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-19 00:57:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:57:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:57:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:57:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:57:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:57:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:57:12,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 00:57:12,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-19 00:57:12,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-19 00:57:12,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-19 00:57:12,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:57:12,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:57:12,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:57:12,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:57:12,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:57:12,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:57:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:57:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 00:57:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 00:57:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 00:57:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:57:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:57:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:57:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:57:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:57:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:57:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:57:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 00:57:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 00:57:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 00:57:12,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:57:12,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:57:12,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:57:12,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:57:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:57:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:57:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:57:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 00:57:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 00:57:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 00:57:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:57:12,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:57:12,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:57:12,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:57:12,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:57:12,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 00:57:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 00:57:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 00:57:12,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:57:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:57:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:57:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:57:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:57:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:57:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:57:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 00:57:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 00:57:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 00:57:12,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:57:12,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:57:13,020 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-19 00:57:13,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:57:13,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:57:13,036 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:57:13,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:13 BoogieIcfgContainer [2024-11-19 00:57:13,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:57:13,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:57:13,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:57:13,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:57:13,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:57:11" (1/3) ... [2024-11-19 00:57:13,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e176d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:57:13, skipping insertion in model container [2024-11-19 00:57:13,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:12" (2/3) ... [2024-11-19 00:57:13,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e176d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:57:13, skipping insertion in model container [2024-11-19 00:57:13,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:13" (3/3) ... [2024-11-19 00:57:13,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2024-11-19 00:57:13,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:57:13,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:57:13,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:57:13,120 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;@b008dc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:57:13,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:57:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:13,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:13,141 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:13,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-19 00:57:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:13,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875195190] [2024-11-19 00:57:13,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:13,168 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-19 00:57:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:13,174 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-19 00:57:13,177 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-19 00:57:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:13,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:57:13,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 00:57:13,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:13,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:13,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875195190] [2024-11-19 00:57:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875195190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:57:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156431237] [2024-11-19 00:57:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:13,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:57:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:57:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:57:13,618 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:57:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:13,644 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-19 00:57:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:57:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-19 00:57:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:13,653 INFO L225 Difference]: With dead ends: 185 [2024-11-19 00:57:13,653 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 00:57:13,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-19 00:57:13,665 INFO L432 NwaCegarLoop]: 134 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, 134 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-19 00:57:13,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 00:57:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 00:57:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-19 00:57:13,708 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-19 00:57:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:13,708 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-19 00:57:13,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:57:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-19 00:57:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:13,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:13,711 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:13,720 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-19 00:57:13,915 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-19 00:57:13,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:13,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-19 00:57:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:13,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439831683] [2024-11-19 00:57:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:13,918 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-19 00:57:13,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:13,921 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-19 00:57:13,922 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-19 00:57:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:14,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 00:57:14,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:14,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:14,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439831683] [2024-11-19 00:57:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439831683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:57:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706833789] [2024-11-19 00:57:14,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:14,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:57:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:14,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:57:14,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:57:14,236 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:14,722 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-19 00:57:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:57:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:14,726 INFO L225 Difference]: With dead ends: 182 [2024-11-19 00:57:14,726 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 00:57:14,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:57:14,728 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:14,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:57:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 00:57:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-19 00:57:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-19 00:57:14,736 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-19 00:57:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:14,737 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-19 00:57:14,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-19 00:57:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:14,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:14,738 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:14,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:57:14,938 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-19 00:57:14,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:14,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-19 00:57:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049054684] [2024-11-19 00:57:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:14,940 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-19 00:57:14,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:14,946 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-19 00:57:14,947 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-19 00:57:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:15,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:57:15,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:15,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:15,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049054684] [2024-11-19 00:57:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049054684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:57:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841008670] [2024-11-19 00:57:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:15,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:57:15,331 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:15,429 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-19 00:57:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:57:15,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:15,431 INFO L225 Difference]: With dead ends: 186 [2024-11-19 00:57:15,433 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:57:15,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-19 00:57:15,435 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 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-19 00:57:15,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:57:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:57:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:57:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-19 00:57:15,448 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-19 00:57:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-19 00:57:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-19 00:57:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:15,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:15,452 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:15,461 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-19 00:57:15,652 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-19 00:57:15,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-19 00:57:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299335832] [2024-11-19 00:57:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:15,656 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-19 00:57:15,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:15,659 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-19 00:57:15,660 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-19 00:57:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:15,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:57:15,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:15,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:15,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:15,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299335832] [2024-11-19 00:57:15,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299335832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:15,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:15,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:57:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712883167] [2024-11-19 00:57:15,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:15,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:57:15,916 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:17,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:57:18,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:57:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:18,822 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-19 00:57:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:57:18,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:18,824 INFO L225 Difference]: With dead ends: 194 [2024-11-19 00:57:18,824 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 00:57:18,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-19 00:57:18,825 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:18,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 00:57:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 00:57:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-19 00:57:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:57:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-19 00:57:18,832 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-19 00:57:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:18,832 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-19 00:57:18,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-19 00:57:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:18,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:18,833 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:18,841 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-19 00:57:19,034 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-19 00:57:19,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:19,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-19 00:57:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860757185] [2024-11-19 00:57:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:19,044 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-19 00:57:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:19,046 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-19 00:57:19,050 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-19 00:57:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:19,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:57:19,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:19,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:19,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 62 [2024-11-19 00:57:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:20,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:20,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860757185] [2024-11-19 00:57:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860757185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:57:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56340820] [2024-11-19 00:57:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:20,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:57:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:20,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:57:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:57:20,022 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:20,917 INFO L93 Difference]: Finished difference Result 290 states and 413 transitions. [2024-11-19 00:57:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:57:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:20,919 INFO L225 Difference]: With dead ends: 290 [2024-11-19 00:57:20,919 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 00:57:20,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:57:20,920 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 318 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:20,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 615 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:57:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 00:57:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2024-11-19 00:57:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:57:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2024-11-19 00:57:20,931 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 84 [2024-11-19 00:57:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:20,932 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2024-11-19 00:57:20,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2024-11-19 00:57:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:20,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:20,933 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:20,940 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-19 00:57:21,137 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-19 00:57:21,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:21,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1303975955, now seen corresponding path program 1 times [2024-11-19 00:57:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:21,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126194587] [2024-11-19 00:57:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:21,139 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-19 00:57:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:21,143 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-19 00:57:21,144 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-19 00:57:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:21,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:57:21,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:21,771 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 19 [2024-11-19 00:57:21,776 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 13 treesize of output 9 [2024-11-19 00:57:21,969 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 30 treesize of output 18 [2024-11-19 00:57:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 00:57:22,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:22,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:22,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-19 00:57:22,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126194587] [2024-11-19 00:57:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126194587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:22,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [880007761] [2024-11-19 00:57:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:22,837 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:57:22,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:57:22,841 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:57:22,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-19 00:57:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:23,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:57:23,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:23,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:23,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 58 [2024-11-19 00:57:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:23,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [880007761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-19 00:57:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139207277] [2024-11-19 00:57:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:57:23,659 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:25,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:57:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:25,107 INFO L93 Difference]: Finished difference Result 415 states and 593 transitions. [2024-11-19 00:57:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:57:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:25,110 INFO L225 Difference]: With dead ends: 415 [2024-11-19 00:57:25,110 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 00:57:25,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:57:25,111 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:25,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 482 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 00:57:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 00:57:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 145. [2024-11-19 00:57:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 124 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:57:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 206 transitions. [2024-11-19 00:57:25,124 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 206 transitions. Word has length 84 [2024-11-19 00:57:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:25,125 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 206 transitions. [2024-11-19 00:57:25,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 206 transitions. [2024-11-19 00:57:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 00:57:25,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:25,126 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:25,140 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-19 00:57:25,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-19 00:57:25,534 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:57:25,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1363453396, now seen corresponding path program 1 times [2024-11-19 00:57:25,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:25,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239700356] [2024-11-19 00:57:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:25,536 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-19 00:57:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:25,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:57:25,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:57:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:25,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:57:25,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:25,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:25,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239700356] [2024-11-19 00:57:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239700356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:57:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456593512] [2024-11-19 00:57:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:57:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:57:25,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:57:25,725 INFO L87 Difference]: Start difference. First operand 145 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:25,766 INFO L93 Difference]: Finished difference Result 287 states and 409 transitions. [2024-11-19 00:57:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:57:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-19 00:57:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:25,767 INFO L225 Difference]: With dead ends: 287 [2024-11-19 00:57:25,767 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 00:57:25,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-19 00:57:25,768 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:25,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 00:57:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-19 00:57:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:57:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-11-19 00:57:25,779 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 84 [2024-11-19 00:57:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:25,779 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-11-19 00:57:25,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-11-19 00:57:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 00:57:25,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:25,781 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:25,788 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:25,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:57:25,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash -760820634, now seen corresponding path program 1 times [2024-11-19 00:57:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411244326] [2024-11-19 00:57:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:25,987 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-19 00:57:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:25,989 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-19 00:57:25,990 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-19 00:57:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:26,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 00:57:26,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:26,795 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 36 treesize of output 24 [2024-11-19 00:57:26,799 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 13 treesize of output 9 [2024-11-19 00:57:27,004 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 30 treesize of output 18 [2024-11-19 00:57:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 00:57:27,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:27,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411244326] [2024-11-19 00:57:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411244326] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-19 00:57:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661418305] [2024-11-19 00:57:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:57:27,206 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:27,514 INFO L93 Difference]: Finished difference Result 426 states and 605 transitions. [2024-11-19 00:57:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:57:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-19 00:57:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:27,516 INFO L225 Difference]: With dead ends: 426 [2024-11-19 00:57:27,516 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 00:57:27,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:57:27,517 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:27,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 460 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:57:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 00:57:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2024-11-19 00:57:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 219 states have internal predecessors, (295), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:57:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 367 transitions. [2024-11-19 00:57:27,541 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 367 transitions. Word has length 86 [2024-11-19 00:57:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:27,541 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 367 transitions. [2024-11-19 00:57:27,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 367 transitions. [2024-11-19 00:57:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 00:57:27,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:27,542 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:27,550 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-19 00:57:27,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:27,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1522767668, now seen corresponding path program 1 times [2024-11-19 00:57:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038997898] [2024-11-19 00:57:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:27,748 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-19 00:57:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:27,750 INFO L229 MonitoredProcess]: Starting monitored process 11 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-19 00:57:27,751 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 (11)] Waiting until timeout for monitored process [2024-11-19 00:57:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:27,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 00:57:27,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:28,307 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 17 treesize of output 13 [2024-11-19 00:57:28,459 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 66 treesize of output 50 [2024-11-19 00:57:28,461 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 68 treesize of output 44 [2024-11-19 00:57:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 00:57:28,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:28,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:28,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038997898] [2024-11-19 00:57:28,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038997898] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:28,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:28,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2024-11-19 00:57:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689644934] [2024-11-19 00:57:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:57:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:57:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:57:28,702 INFO L87 Difference]: Start difference. First operand 260 states and 367 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:29,187 INFO L93 Difference]: Finished difference Result 754 states and 1048 transitions. [2024-11-19 00:57:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:57:29,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-19 00:57:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:29,190 INFO L225 Difference]: With dead ends: 754 [2024-11-19 00:57:29,190 INFO L226 Difference]: Without dead ends: 497 [2024-11-19 00:57:29,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:57:29,191 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 174 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:29,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 803 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:57:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-19 00:57:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 439. [2024-11-19 00:57:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 390 states have (on average 1.3615384615384616) internal successors, (531), 394 states have internal predecessors, (531), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:57:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 611 transitions. [2024-11-19 00:57:29,224 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 611 transitions. Word has length 86 [2024-11-19 00:57:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:29,224 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 611 transitions. [2024-11-19 00:57:29,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 611 transitions. [2024-11-19 00:57:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 00:57:29,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:29,225 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:29,232 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:29,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-19 00:57:29,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1963105168, now seen corresponding path program 1 times [2024-11-19 00:57:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318997098] [2024-11-19 00:57:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:29,431 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-19 00:57:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:29,433 INFO L229 MonitoredProcess]: Starting monitored process 12 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-19 00:57:29,434 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 (12)] Waiting until timeout for monitored process [2024-11-19 00:57:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:29,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:57:29,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:30,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:30,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 60 [2024-11-19 00:57:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:57:30,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:30,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318997098] [2024-11-19 00:57:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318997098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [914710879] [2024-11-19 00:57:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:30,448 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:57:30,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:57:30,452 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:57:30,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-19 00:57:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:31,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 00:57:31,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-19 00:57:32,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-19 00:57:32,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 60 [2024-11-19 00:57:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:57:33,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [914710879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:33,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:57:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-19 00:57:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717768799] [2024-11-19 00:57:33,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:57:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 00:57:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 00:57:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:57:33,533 INFO L87 Difference]: Start difference. First operand 439 states and 611 transitions. Second operand has 20 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:57:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:34,960 INFO L93 Difference]: Finished difference Result 1178 states and 1630 transitions. [2024-11-19 00:57:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:57:34,966 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 86 [2024-11-19 00:57:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:34,970 INFO L225 Difference]: With dead ends: 1178 [2024-11-19 00:57:34,970 INFO L226 Difference]: Without dead ends: 742 [2024-11-19 00:57:34,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 00:57:34,976 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 299 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:34,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1365 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 534 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:57:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-19 00:57:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 491. [2024-11-19 00:57:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 420 states have (on average 1.3357142857142856) internal successors, (561), 426 states have internal predecessors, (561), 58 states have call successors, (58), 12 states have call predecessors, (58), 12 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 00:57:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 677 transitions. [2024-11-19 00:57:35,047 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 677 transitions. Word has length 86 [2024-11-19 00:57:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:35,047 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 677 transitions. [2024-11-19 00:57:35,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:57:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 677 transitions. [2024-11-19 00:57:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 00:57:35,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:35,055 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:35,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-19 00:57:35,265 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 (12)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /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-19 00:57:35,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1124071506, now seen corresponding path program 1 times [2024-11-19 00:57:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476468733] [2024-11-19 00:57:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:35,462 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-19 00:57:35,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:35,464 INFO L229 MonitoredProcess]: Starting monitored process 14 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-19 00:57:35,465 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 (14)] Waiting until timeout for monitored process [2024-11-19 00:57:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:35,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:57:35,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:57:35,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:35,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:35,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476468733] [2024-11-19 00:57:35,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476468733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:35,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:35,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:57:35,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124635538] [2024-11-19 00:57:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:35,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:57:35,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:57:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:57:35,742 INFO L87 Difference]: Start difference. First operand 491 states and 677 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:57:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:35,854 INFO L93 Difference]: Finished difference Result 886 states and 1204 transitions. [2024-11-19 00:57:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:57:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2024-11-19 00:57:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:35,860 INFO L225 Difference]: With dead ends: 886 [2024-11-19 00:57:35,860 INFO L226 Difference]: Without dead ends: 374 [2024-11-19 00:57:35,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:57:35,865 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:35,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:57:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-19 00:57:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 360. [2024-11-19 00:57:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 313 states have (on average 1.31629392971246) internal successors, (412), 317 states have internal predecessors, (412), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:57:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 488 transitions. [2024-11-19 00:57:35,899 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 488 transitions. Word has length 86 [2024-11-19 00:57:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:35,900 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 488 transitions. [2024-11-19 00:57:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:57:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 488 transitions. [2024-11-19 00:57:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 00:57:35,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:35,902 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:35,914 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 (14)] Ended with exit code 0 [2024-11-19 00:57:36,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-19 00:57:36,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:36,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -513934107, now seen corresponding path program 1 times [2024-11-19 00:57:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669390590] [2024-11-19 00:57:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:36,107 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-19 00:57:36,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:36,109 INFO L229 MonitoredProcess]: Starting monitored process 15 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-19 00:57:36,110 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 (15)] Waiting until timeout for monitored process [2024-11-19 00:57:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:36,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:57:36,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:36,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:36,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:36,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669390590] [2024-11-19 00:57:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669390590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:57:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700583227] [2024-11-19 00:57:36,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:36,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:57:36,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:57:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:57:36,366 INFO L87 Difference]: Start difference. First operand 360 states and 488 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:36,516 INFO L93 Difference]: Finished difference Result 999 states and 1344 transitions. [2024-11-19 00:57:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:57:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-11-19 00:57:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:36,519 INFO L225 Difference]: With dead ends: 999 [2024-11-19 00:57:36,520 INFO L226 Difference]: Without dead ends: 642 [2024-11-19 00:57:36,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-19 00:57:36,521 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 217 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:36,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 346 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:57:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-19 00:57:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 478. [2024-11-19 00:57:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 420 states have (on average 1.3023809523809524) internal successors, (547), 424 states have internal predecessors, (547), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 00:57:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 641 transitions. [2024-11-19 00:57:36,568 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 641 transitions. Word has length 87 [2024-11-19 00:57:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:36,569 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 641 transitions. [2024-11-19 00:57:36,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 641 transitions. [2024-11-19 00:57:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 00:57:36,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:36,570 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:36,582 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:36,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-19 00:57:36,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 561473697, now seen corresponding path program 1 times [2024-11-19 00:57:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230167266] [2024-11-19 00:57:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:36,775 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-19 00:57:36,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:36,778 INFO L229 MonitoredProcess]: Starting monitored process 16 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-19 00:57:36,778 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 (16)] Waiting until timeout for monitored process [2024-11-19 00:57:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:37,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:57:37,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:38,459 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 18 treesize of output 19 [2024-11-19 00:57:38,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:38,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2024-11-19 00:57:38,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:38,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 79 [2024-11-19 00:57:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:38,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:38,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230167266] [2024-11-19 00:57:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230167266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:57:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742749391] [2024-11-19 00:57:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:38,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:57:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:57:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:57:38,997 INFO L87 Difference]: Start difference. First operand 478 states and 641 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:42,017 INFO L93 Difference]: Finished difference Result 1384 states and 1859 transitions. [2024-11-19 00:57:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 00:57:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-11-19 00:57:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:42,023 INFO L225 Difference]: With dead ends: 1384 [2024-11-19 00:57:42,023 INFO L226 Difference]: Without dead ends: 909 [2024-11-19 00:57:42,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:57:42,029 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 381 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:42,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1560 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 00:57:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-19 00:57:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 609. [2024-11-19 00:57:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.3166666666666667) internal successors, (711), 542 states have internal predecessors, (711), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 00:57:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 823 transitions. [2024-11-19 00:57:42,099 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 823 transitions. Word has length 88 [2024-11-19 00:57:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:42,100 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 823 transitions. [2024-11-19 00:57:42,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 823 transitions. [2024-11-19 00:57:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 00:57:42,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:42,101 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:42,115 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 (16)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-19 00:57:42,302 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:42,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -25332317, now seen corresponding path program 1 times [2024-11-19 00:57:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:42,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398821846] [2024-11-19 00:57:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:42,303 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-19 00:57:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:42,305 INFO L229 MonitoredProcess]: Starting monitored process 17 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-19 00:57:42,306 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 (17)] Waiting until timeout for monitored process [2024-11-19 00:57:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:42,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:57:42,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:43,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:43,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 36 [2024-11-19 00:57:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:43,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:43,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:43,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398821846] [2024-11-19 00:57:43,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398821846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:43,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:43,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:57:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634480298] [2024-11-19 00:57:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:43,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:57:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:57:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:57:43,129 INFO L87 Difference]: Start difference. First operand 609 states and 823 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:43,736 INFO L93 Difference]: Finished difference Result 1407 states and 1896 transitions. [2024-11-19 00:57:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:57:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-11-19 00:57:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:43,740 INFO L225 Difference]: With dead ends: 1407 [2024-11-19 00:57:43,740 INFO L226 Difference]: Without dead ends: 801 [2024-11-19 00:57:43,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:57:43,741 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 286 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:43,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 567 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:57:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-19 00:57:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 609. [2024-11-19 00:57:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.3074074074074074) internal successors, (706), 542 states have internal predecessors, (706), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 00:57:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 818 transitions. [2024-11-19 00:57:43,782 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 818 transitions. Word has length 88 [2024-11-19 00:57:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:43,783 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 818 transitions. [2024-11-19 00:57:43,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 818 transitions. [2024-11-19 00:57:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 00:57:43,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:43,784 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:43,793 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 (17)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:43,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-19 00:57:43,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:43,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1436083919, now seen corresponding path program 1 times [2024-11-19 00:57:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741776960] [2024-11-19 00:57:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:43,988 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-19 00:57:43,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:43,989 INFO L229 MonitoredProcess]: Starting monitored process 18 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-19 00:57:43,991 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 (18)] Waiting until timeout for monitored process [2024-11-19 00:57:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:44,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:57:44,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 00:57:44,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:44,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741776960] [2024-11-19 00:57:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741776960] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:44,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-19 00:57:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400607601] [2024-11-19 00:57:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:44,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:44,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:57:44,546 INFO L87 Difference]: Start difference. First operand 609 states and 818 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:44,627 INFO L93 Difference]: Finished difference Result 1622 states and 2170 transitions. [2024-11-19 00:57:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:57:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-19 00:57:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:44,635 INFO L225 Difference]: With dead ends: 1622 [2024-11-19 00:57:44,635 INFO L226 Difference]: Without dead ends: 1016 [2024-11-19 00:57:44,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:57:44,637 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 88 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:44,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 490 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-19 00:57:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1010. [2024-11-19 00:57:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 909 states have (on average 1.308030803080308) internal successors, (1189), 917 states have internal predecessors, (1189), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-19 00:57:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1345 transitions. [2024-11-19 00:57:44,697 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1345 transitions. Word has length 89 [2024-11-19 00:57:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1345 transitions. [2024-11-19 00:57:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1345 transitions. [2024-11-19 00:57:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 00:57:44,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:44,699 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:44,706 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:44,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-19 00:57:44,903 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2116142289, now seen corresponding path program 1 times [2024-11-19 00:57:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811442457] [2024-11-19 00:57:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:44,905 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-19 00:57:44,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:44,907 INFO L229 MonitoredProcess]: Starting monitored process 19 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-19 00:57:44,912 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 (19)] Waiting until timeout for monitored process [2024-11-19 00:57:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:45,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 00:57:45,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:45,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 00:57:46,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:46,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 145 [2024-11-19 00:57:46,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:46,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 135 [2024-11-19 00:57:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:46,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:46,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811442457] [2024-11-19 00:57:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811442457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:46,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:57:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811685360] [2024-11-19 00:57:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:46,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:57:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:57:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:57:46,473 INFO L87 Difference]: Start difference. First operand 1010 states and 1345 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:52,248 INFO L93 Difference]: Finished difference Result 1390 states and 1842 transitions. [2024-11-19 00:57:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:57:52,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-19 00:57:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:52,259 INFO L225 Difference]: With dead ends: 1390 [2024-11-19 00:57:52,259 INFO L226 Difference]: Without dead ends: 1388 [2024-11-19 00:57:52,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2024-11-19 00:57:52,261 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 282 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:52,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 912 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:57:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-19 00:57:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1316. [2024-11-19 00:57:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1215 states have (on average 1.3135802469135802) internal successors, (1596), 1223 states have internal predecessors, (1596), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-19 00:57:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1752 transitions. [2024-11-19 00:57:52,347 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1752 transitions. Word has length 89 [2024-11-19 00:57:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:52,348 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1752 transitions. [2024-11-19 00:57:52,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1752 transitions. [2024-11-19 00:57:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 00:57:52,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:52,349 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:52,366 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 (19)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:52,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-19 00:57:52,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:52,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2117989331, now seen corresponding path program 1 times [2024-11-19 00:57:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:52,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992872152] [2024-11-19 00:57:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:52,552 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-19 00:57:52,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:52,555 INFO L229 MonitoredProcess]: Starting monitored process 20 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-19 00:57:52,556 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 (20)] Waiting until timeout for monitored process [2024-11-19 00:57:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:52,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:57:52,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:57:52,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:52,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992872152] [2024-11-19 00:57:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992872152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:57:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961499494] [2024-11-19 00:57:52,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:52,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:57:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:57:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:57:52,831 INFO L87 Difference]: Start difference. First operand 1316 states and 1752 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:52,919 INFO L93 Difference]: Finished difference Result 2683 states and 3573 transitions. [2024-11-19 00:57:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:57:52,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-19 00:57:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:52,925 INFO L225 Difference]: With dead ends: 2683 [2024-11-19 00:57:52,925 INFO L226 Difference]: Without dead ends: 1370 [2024-11-19 00:57:52,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-19 00:57:52,928 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 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-19 00:57:52,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:57:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-11-19 00:57:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2024-11-19 00:57:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1269 states have (on average 1.3002364066193854) internal successors, (1650), 1277 states have internal predecessors, (1650), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-19 00:57:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1806 transitions. [2024-11-19 00:57:53,029 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1806 transitions. Word has length 89 [2024-11-19 00:57:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:53,029 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1806 transitions. [2024-11-19 00:57:53,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 00:57:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1806 transitions. [2024-11-19 00:57:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 00:57:53,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:53,031 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:57:53,039 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 (20)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:53,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-19 00:57:53,232 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -329620377, now seen corresponding path program 1 times [2024-11-19 00:57:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964624884] [2024-11-19 00:57:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:53,234 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-19 00:57:53,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:53,235 INFO L229 MonitoredProcess]: Starting monitored process 21 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-19 00:57:53,236 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 (21)] Waiting until timeout for monitored process [2024-11-19 00:57:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:53,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:57:53,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:54,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:57:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 54 [2024-11-19 00:57:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:57:54,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:55,578 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2024-11-19 00:57:55,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 92 [2024-11-19 00:58:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:58:02,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:58:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964624884] [2024-11-19 00:58:02,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964624884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:58:02,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:58:02,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-19 00:58:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810987766] [2024-11-19 00:58:02,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:58:03,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 00:58:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:58:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 00:58:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2024-11-19 00:58:03,000 INFO L87 Difference]: Start difference. First operand 1370 states and 1806 transitions. Second operand has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:58:08,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:58:12,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:58:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:58:12,686 INFO L93 Difference]: Finished difference Result 2815 states and 3695 transitions. [2024-11-19 00:58:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:58:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2024-11-19 00:58:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:58:12,692 INFO L225 Difference]: With dead ends: 2815 [2024-11-19 00:58:12,692 INFO L226 Difference]: Without dead ends: 1448 [2024-11-19 00:58:12,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=212, Invalid=717, Unknown=1, NotChecked=0, Total=930 [2024-11-19 00:58:12,695 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 465 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:58:12,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1530 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 511 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-19 00:58:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-19 00:58:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1370. [2024-11-19 00:58:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1269 states have (on average 1.2923561859732073) internal successors, (1640), 1277 states have internal predecessors, (1640), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-19 00:58:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1796 transitions. [2024-11-19 00:58:12,771 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1796 transitions. Word has length 90 [2024-11-19 00:58:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:58:12,773 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1796 transitions. [2024-11-19 00:58:12,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:58:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1796 transitions. [2024-11-19 00:58:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 00:58:12,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:58:12,774 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:58:12,785 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 (21)] Ended with exit code 0 [2024-11-19 00:58:12,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-19 00:58:12,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:58:12,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:58:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1971202213, now seen corresponding path program 1 times [2024-11-19 00:58:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:58:12,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957599476] [2024-11-19 00:58:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:58:12,979 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-19 00:58:12,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:58:12,981 INFO L229 MonitoredProcess]: Starting monitored process 22 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-19 00:58:12,982 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 (22)] Waiting until timeout for monitored process [2024-11-19 00:58:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:58:13,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:58:13,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:58:14,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:58:14,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 54 [2024-11-19 00:58:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:58:14,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:58:15,300 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2024-11-19 00:58:15,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 92 [2024-11-19 00:58:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:58:22,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:58:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957599476] [2024-11-19 00:58:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957599476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:58:22,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:58:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-19 00:58:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525171813] [2024-11-19 00:58:22,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:58:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 00:58:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:58:22,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 00:58:22,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2024-11-19 00:58:22,475 INFO L87 Difference]: Start difference. First operand 1370 states and 1796 transitions. Second operand has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:58:27,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:58:31,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:58:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:58:32,232 INFO L93 Difference]: Finished difference Result 2815 states and 3675 transitions. [2024-11-19 00:58:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:58:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2024-11-19 00:58:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:58:32,239 INFO L225 Difference]: With dead ends: 2815 [2024-11-19 00:58:32,239 INFO L226 Difference]: Without dead ends: 1448 [2024-11-19 00:58:32,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=212, Invalid=717, Unknown=1, NotChecked=0, Total=930 [2024-11-19 00:58:32,242 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 602 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:58:32,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1788 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 587 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-19 00:58:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-19 00:58:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1370. [2024-11-19 00:58:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1269 states have (on average 1.285263987391647) internal successors, (1631), 1277 states have internal predecessors, (1631), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-19 00:58:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1787 transitions. [2024-11-19 00:58:32,311 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1787 transitions. Word has length 90 [2024-11-19 00:58:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:58:32,311 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1787 transitions. [2024-11-19 00:58:32,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:58:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1787 transitions. [2024-11-19 00:58:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 00:58:32,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:58:32,314 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:58:32,325 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 (22)] Forceful destruction successful, exit code 0 [2024-11-19 00:58:32,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-19 00:58:32,518 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:58:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:58:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1384396199, now seen corresponding path program 1 times [2024-11-19 00:58:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:58:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143248807] [2024-11-19 00:58:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:58:32,519 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-19 00:58:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:58:32,521 INFO L229 MonitoredProcess]: Starting monitored process 23 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-19 00:58:32,522 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 (23)] Waiting until timeout for monitored process [2024-11-19 00:58:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:58:32,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 00:58:32,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:58:34,459 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 18 treesize of output 19 [2024-11-19 00:58:34,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:58:34,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2024-11-19 00:58:34,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:58:34,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 75 [2024-11-19 00:58:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:58:34,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:58:35,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:58:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143248807] [2024-11-19 00:58:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143248807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:58:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [61969336] [2024-11-19 00:58:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:58:35,720 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:58:35,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:58:35,723 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:58:35,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-19 00:58:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:58:37,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 00:58:37,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:58:37,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17