./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.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-a_file-54.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 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:36:46,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:36:46,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:36:46,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:36:46,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:36:46,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:36:46,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:36:46,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:36:46,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:36:46,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:36:46,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:36:46,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:36:46,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:36:46,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:36:46,163 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:36:46,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:36:46,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:36:46,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:36:46,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:36:46,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:36:46,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:36:46,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:36:46,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:36:46,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:36:46,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:36:46,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:36:46,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:36:46,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:36:46,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:36:46,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:36:46,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:36:46,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:36:46,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:36:46,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:36:46,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:36:46,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:36:46,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:36:46,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:36:46,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:36:46,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:36:46,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:36:46,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:36:46,173 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 -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2024-11-19 00:36:46,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:36:46,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:36:46,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:36:46,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:36:46,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:36:46,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-11-19 00:36:47,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:36:48,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:36:48,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-11-19 00:36:48,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04abf5660/282e1546007b4048b0601e20eda73977/FLAG6aac0c5e1 [2024-11-19 00:36:48,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04abf5660/282e1546007b4048b0601e20eda73977 [2024-11-19 00:36:48,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:36:48,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:36:48,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:36:48,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:36:48,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:36:48,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3280843a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48, skipping insertion in model container [2024-11-19 00:36:48,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:36:48,643 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-a_file-54.i[916,929] [2024-11-19 00:36:48,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:36:48,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:36:48,744 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-a_file-54.i[916,929] [2024-11-19 00:36:48,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:36:48,797 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:36:48,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48 WrapperNode [2024-11-19 00:36:48,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:36:48,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:36:48,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:36:48,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:36:48,806 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:36:48" (1/1) ... [2024-11-19 00:36:48,820 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:36:48" (1/1) ... [2024-11-19 00:36:48,860 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2024-11-19 00:36:48,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:36:48,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:36:48,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:36:48,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:36:48,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,935 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2024-11-19 00:36:48,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:48,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:36:48,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:36:48,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:36:48,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:36:48,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (1/1) ... [2024-11-19 00:36:49,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:36:49,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:36:49,061 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:36:49,067 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:36:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:36:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:36:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:36:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:36:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:36:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:36:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:36:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:36:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:36:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:36:49,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:36:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:36:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:36:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:36:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:36:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:36:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:36:49,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:36:49,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:36:49,801 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-19 00:36:49,801 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:36:49,819 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:36:49,820 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:36:49,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:36:49 BoogieIcfgContainer [2024-11-19 00:36:49,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:36:49,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:36:49,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:36:49,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:36:49,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:36:48" (1/3) ... [2024-11-19 00:36:49,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb7a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:36:49, skipping insertion in model container [2024-11-19 00:36:49,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:48" (2/3) ... [2024-11-19 00:36:49,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb7a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:36:49, skipping insertion in model container [2024-11-19 00:36:49,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:36:49" (3/3) ... [2024-11-19 00:36:49,829 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2024-11-19 00:36:49,844 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:36:49,845 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:36:49,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:36:49,908 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;@4762eb1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:36:49,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:36:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:36:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:49,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:49,930 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:49,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -772808128, now seen corresponding path program 1 times [2024-11-19 00:36:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806497482] [2024-11-19 00:36:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:36:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806497482] [2024-11-19 00:36:50,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806497482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:50,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466047786] [2024-11-19 00:36:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:50,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:36:50,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:36:50,289 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:36:50,290 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:36:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:50,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:36:50,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:36:50,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466047786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:50,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:50,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:36:50,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105272754] [2024-11-19 00:36:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:50,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:36:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:50,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:36:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:36:50,598 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:50,628 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-19 00:36:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:36:50,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-19 00:36:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:50,641 INFO L225 Difference]: With dead ends: 213 [2024-11-19 00:36:50,641 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:36:50,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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:36:50,648 INFO L432 NwaCegarLoop]: 155 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, 155 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:36:50,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:36:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 00:36:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:36:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 00:36:50,698 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-19 00:36:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:50,699 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 00:36:50,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 00:36:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:50,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:50,702 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:50,716 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:36:50,903 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:36:50,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:50,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1959980268, now seen corresponding path program 1 times [2024-11-19 00:36:50,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:50,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967156336] [2024-11-19 00:36:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:36:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967156336] [2024-11-19 00:36:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967156336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922183687] [2024-11-19 00:36:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:51,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:36:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:36:51,258 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:36:51,259 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:36:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:51,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:51,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:51,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922183687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:36:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508527567] [2024-11-19 00:36:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:51,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:51,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:51,532 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:51,572 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-11-19 00:36:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:51,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 00:36:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:51,575 INFO L225 Difference]: With dead ends: 212 [2024-11-19 00:36:51,575 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 00:36:51,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:51,577 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:51,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 00:36:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-19 00:36:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:36:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 00:36:51,589 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-19 00:36:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:51,590 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 00:36:51,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 00:36:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:51,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:51,595 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:51,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:51,798 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,SelfDestructingSolverStorable1 [2024-11-19 00:36:51,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:51,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash -559979666, now seen corresponding path program 1 times [2024-11-19 00:36:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115157256] [2024-11-19 00:36:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:36:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115157256] [2024-11-19 00:36:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115157256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88618506] [2024-11-19 00:36:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:52,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:36:52,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:36:52,022 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:36:52,024 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:36:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:52,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:52,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:52,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88618506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:36:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678905917] [2024-11-19 00:36:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:52,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:52,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:52,242 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:52,281 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-19 00:36:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 00:36:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:52,284 INFO L225 Difference]: With dead ends: 216 [2024-11-19 00:36:52,284 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:36:52,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:52,286 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:52,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:36:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-19 00:36:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:36:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-19 00:36:52,295 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 105 [2024-11-19 00:36:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:52,295 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-19 00:36:52,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-19 00:36:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:52,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:52,298 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,315 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:36:52,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:36:52,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:52,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -558132624, now seen corresponding path program 1 times [2024-11-19 00:36:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989356019] [2024-11-19 00:36:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:36:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989356019] [2024-11-19 00:36:52,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989356019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628242042] [2024-11-19 00:36:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:36:52,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:36:52,686 INFO L229 MonitoredProcess]: Starting monitored process 5 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:36:52,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:36:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:52,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:52,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:52,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628242042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:36:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048939455] [2024-11-19 00:36:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:52,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:52,918 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:52,947 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2024-11-19 00:36:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 00:36:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:52,952 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:36:52,952 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 00:36:52,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:52,957 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:52,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 00:36:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 00:36:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:36:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-19 00:36:52,972 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 105 [2024-11-19 00:36:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:52,973 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-19 00:36:52,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-19 00:36:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:36:52,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:52,979 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:53,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:36:53,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:36:53,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:53,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash 813028843, now seen corresponding path program 1 times [2024-11-19 00:36:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:53,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594949569] [2024-11-19 00:36:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594949569] [2024-11-19 00:36:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594949569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762543862] [2024-11-19 00:36:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:53,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:53,440 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:53,557 INFO L93 Difference]: Finished difference Result 323 states and 466 transitions. [2024-11-19 00:36:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:53,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 00:36:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:53,561 INFO L225 Difference]: With dead ends: 323 [2024-11-19 00:36:53,561 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 00:36:53,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:53,562 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:53,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 00:36:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-19 00:36:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:36:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-11-19 00:36:53,579 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 107 [2024-11-19 00:36:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:53,580 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-11-19 00:36:53,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-11-19 00:36:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:36:53,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:53,585 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:53,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:36:53,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:53,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1898838398, now seen corresponding path program 1 times [2024-11-19 00:36:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784635826] [2024-11-19 00:36:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:53,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784635826] [2024-11-19 00:36:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784635826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:53,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:36:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571164846] [2024-11-19 00:36:53,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:53,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:53,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:53,815 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:53,879 INFO L93 Difference]: Finished difference Result 368 states and 536 transitions. [2024-11-19 00:36:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:53,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 00:36:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:53,882 INFO L225 Difference]: With dead ends: 368 [2024-11-19 00:36:53,882 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 00:36:53,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:36:53,884 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 109 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:53,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 421 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 00:36:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-19 00:36:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:36:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2024-11-19 00:36:53,909 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 108 [2024-11-19 00:36:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2024-11-19 00:36:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2024-11-19 00:36:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:36:53,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:53,911 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:36:53,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:53,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1081189948, now seen corresponding path program 1 times [2024-11-19 00:36:53,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:53,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081835330] [2024-11-19 00:36:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081835330] [2024-11-19 00:36:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081835330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859168060] [2024-11-19 00:36:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:54,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:54,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:54,274 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:54,410 INFO L93 Difference]: Finished difference Result 469 states and 681 transitions. [2024-11-19 00:36:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:54,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 00:36:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:54,412 INFO L225 Difference]: With dead ends: 469 [2024-11-19 00:36:54,412 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 00:36:54,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:54,413 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 101 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:54,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 529 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 00:36:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-19 00:36:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 207 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:36:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2024-11-19 00:36:54,424 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 108 [2024-11-19 00:36:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:54,424 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2024-11-19 00:36:54,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2024-11-19 00:36:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:36:54,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:54,426 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:36:54,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:54,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 494383934, now seen corresponding path program 1 times [2024-11-19 00:36:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024856768] [2024-11-19 00:36:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:55,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024856768] [2024-11-19 00:36:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024856768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:55,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:55,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:36:55,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803440848] [2024-11-19 00:36:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:55,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:55,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:55,538 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:36:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:55,767 INFO L93 Difference]: Finished difference Result 579 states and 826 transitions. [2024-11-19 00:36:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:36:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-19 00:36:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:55,771 INFO L225 Difference]: With dead ends: 579 [2024-11-19 00:36:55,771 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 00:36:55,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:36:55,772 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 67 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:55,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 912 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:36:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 00:36:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2024-11-19 00:36:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 311 states have (on average 1.3794212218649518) internal successors, (429), 313 states have internal predecessors, (429), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:36:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2024-11-19 00:36:55,797 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 108 [2024-11-19 00:36:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2024-11-19 00:36:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:36:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2024-11-19 00:36:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:36:55,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:55,800 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:55,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:36:55,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:55,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 9422404, now seen corresponding path program 1 times [2024-11-19 00:36:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481586692] [2024-11-19 00:36:55,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481586692] [2024-11-19 00:36:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481586692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515411176] [2024-11-19 00:36:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:56,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:56,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:56,270 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:56,442 INFO L93 Difference]: Finished difference Result 730 states and 1031 transitions. [2024-11-19 00:36:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 00:36:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:56,447 INFO L225 Difference]: With dead ends: 730 [2024-11-19 00:36:56,447 INFO L226 Difference]: Without dead ends: 542 [2024-11-19 00:36:56,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:36:56,450 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 133 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:56,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 910 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-19 00:36:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2024-11-19 00:36:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 479 states have (on average 1.37160751565762) internal successors, (657), 484 states have internal predecessors, (657), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:36:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 757 transitions. [2024-11-19 00:36:56,481 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 757 transitions. Word has length 109 [2024-11-19 00:36:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:56,482 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 757 transitions. [2024-11-19 00:36:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 757 transitions. [2024-11-19 00:36:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:36:56,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:56,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:36:56,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:56,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1001694846, now seen corresponding path program 1 times [2024-11-19 00:36:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256153512] [2024-11-19 00:36:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256153512] [2024-11-19 00:36:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256153512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:36:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423977792] [2024-11-19 00:36:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:36:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:36:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:56,937 INFO L87 Difference]: Start difference. First operand 538 states and 757 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:57,189 INFO L93 Difference]: Finished difference Result 1039 states and 1466 transitions. [2024-11-19 00:36:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:36:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 00:36:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:57,196 INFO L225 Difference]: With dead ends: 1039 [2024-11-19 00:36:57,196 INFO L226 Difference]: Without dead ends: 696 [2024-11-19 00:36:57,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:36:57,198 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 141 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:57,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2026 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:36:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-19 00:36:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 687. [2024-11-19 00:36:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 612 states have (on average 1.3676470588235294) internal successors, (837), 618 states have internal predecessors, (837), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:36:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 965 transitions. [2024-11-19 00:36:57,233 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 965 transitions. Word has length 109 [2024-11-19 00:36:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:57,234 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 965 transitions. [2024-11-19 00:36:57,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 965 transitions. [2024-11-19 00:36:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:36:57,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:57,236 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:57,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:36:57,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:57,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 143435910, now seen corresponding path program 1 times [2024-11-19 00:36:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006767659] [2024-11-19 00:36:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006767659] [2024-11-19 00:36:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006767659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:36:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163597492] [2024-11-19 00:36:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:57,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:36:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:36:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:36:57,996 INFO L87 Difference]: Start difference. First operand 687 states and 965 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:58,556 INFO L93 Difference]: Finished difference Result 1308 states and 1841 transitions. [2024-11-19 00:36:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:36:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 00:36:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:58,560 INFO L225 Difference]: With dead ends: 1308 [2024-11-19 00:36:58,560 INFO L226 Difference]: Without dead ends: 816 [2024-11-19 00:36:58,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:36:58,562 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 223 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:58,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2879 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:36:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-19 00:36:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 536. [2024-11-19 00:36:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 477 states have (on average 1.3626834381551363) internal successors, (650), 482 states have internal predecessors, (650), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:36:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 750 transitions. [2024-11-19 00:36:58,593 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 750 transitions. Word has length 109 [2024-11-19 00:36:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:58,594 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 750 transitions. [2024-11-19 00:36:58,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 750 transitions. [2024-11-19 00:36:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:36:58,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:58,596 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:58,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:36:58,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:58,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash -867681340, now seen corresponding path program 1 times [2024-11-19 00:36:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:58,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093776118] [2024-11-19 00:36:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:58,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093776118] [2024-11-19 00:36:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093776118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:58,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:58,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126199455] [2024-11-19 00:36:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:58,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:58,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:58,906 INFO L87 Difference]: Start difference. First operand 536 states and 750 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:59,048 INFO L93 Difference]: Finished difference Result 997 states and 1396 transitions. [2024-11-19 00:36:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:59,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 00:36:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:59,051 INFO L225 Difference]: With dead ends: 997 [2024-11-19 00:36:59,051 INFO L226 Difference]: Without dead ends: 656 [2024-11-19 00:36:59,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:59,053 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 129 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:59,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1060 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-19 00:36:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 528. [2024-11-19 00:36:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3603411513859276) internal successors, (638), 474 states have internal predecessors, (638), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:36:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 738 transitions. [2024-11-19 00:36:59,080 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 738 transitions. Word has length 109 [2024-11-19 00:36:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:59,080 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 738 transitions. [2024-11-19 00:36:59,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:36:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 738 transitions. [2024-11-19 00:36:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:36:59,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:59,082 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:36:59,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:59,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1465883152, now seen corresponding path program 1 times [2024-11-19 00:36:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205172945] [2024-11-19 00:36:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:36:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:36:59,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205172945] [2024-11-19 00:36:59,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205172945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:59,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:59,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282238080] [2024-11-19 00:36:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:59,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:36:59,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:59,406 INFO L87 Difference]: Start difference. First operand 528 states and 738 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:59,475 INFO L93 Difference]: Finished difference Result 560 states and 772 transitions. [2024-11-19 00:36:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-19 00:36:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:59,478 INFO L225 Difference]: With dead ends: 560 [2024-11-19 00:36:59,478 INFO L226 Difference]: Without dead ends: 558 [2024-11-19 00:36:59,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:59,479 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:59,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-19 00:36:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2024-11-19 00:36:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 496 states have (on average 1.340725806451613) internal successors, (665), 501 states have internal predecessors, (665), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 00:36:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 765 transitions. [2024-11-19 00:36:59,510 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 765 transitions. Word has length 110 [2024-11-19 00:36:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 765 transitions. [2024-11-19 00:36:59,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:36:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 765 transitions. [2024-11-19 00:36:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:36:59,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:59,512 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:36:59,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:59,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1467730194, now seen corresponding path program 1 times [2024-11-19 00:36:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:36:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402259784] [2024-11-19 00:36:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:36:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:36:59,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:36:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:36:59,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:36:59,622 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:36:59,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:36:59,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:36:59,627 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:59,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:36:59,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:36:59 BoogieIcfgContainer [2024-11-19 00:36:59,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:36:59,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:36:59,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:36:59,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:36:59,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:36:49" (3/4) ... [2024-11-19 00:36:59,732 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:36:59,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:36:59,734 INFO L158 Benchmark]: Toolchain (without parser) took 11302.62ms. Allocated memory was 188.7MB in the beginning and 346.0MB in the end (delta: 157.3MB). Free memory was 122.0MB in the beginning and 197.4MB in the end (delta: -75.4MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-11-19 00:36:59,734 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:36:59,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.50ms. Allocated memory is still 188.7MB. Free memory was 121.8MB in the beginning and 105.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:36:59,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.46ms. Allocated memory is still 188.7MB. Free memory was 105.3MB in the beginning and 101.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:36:59,735 INFO L158 Benchmark]: Boogie Preprocessor took 117.40ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 158.5MB in the end (delta: -57.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-19 00:36:59,735 INFO L158 Benchmark]: RCFGBuilder took 837.00ms. Allocated memory is still 188.7MB. Free memory was 158.5MB in the beginning and 123.6MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 00:36:59,736 INFO L158 Benchmark]: TraceAbstraction took 9906.57ms. Allocated memory was 188.7MB in the beginning and 346.0MB in the end (delta: 157.3MB). Free memory was 122.9MB in the beginning and 197.4MB in the end (delta: -74.5MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2024-11-19 00:36:59,736 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 346.0MB. Free memory is still 197.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:36:59,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.50ms. Allocated memory is still 188.7MB. Free memory was 121.8MB in the beginning and 105.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.46ms. Allocated memory is still 188.7MB. Free memory was 105.3MB in the beginning and 101.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.40ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 158.5MB in the end (delta: -57.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * RCFGBuilder took 837.00ms. Allocated memory is still 188.7MB. Free memory was 158.5MB in the beginning and 123.6MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9906.57ms. Allocated memory was 188.7MB in the beginning and 346.0MB in the end (delta: 157.3MB). Free memory was 122.9MB in the beginning and 197.4MB in the end (delta: -74.5MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 346.0MB. Free memory is still 197.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 84, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] double_Array_0[1] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] RET updateVariables() [L104] CALL step() [L40] EXPR double_Array_0[0] [L40] float_Array_0[0] = double_Array_0[0] [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L42] signed long int stepLocal_0 = -4; [L43] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L43] COND FALSE !(stepLocal_0 >= signed_char_Array_0[1]) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned char stepLocal_2 = unsigned_char_Array_0[0]; [L47] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L56] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L56] EXPR unsigned_char_Array_0[1] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_2=9, unsigned_char_Array_0={8:0}] [L56] signed long int stepLocal_1 = (((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])); [L57] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L57] COND FALSE !((8 * unsigned_char_Array_0[1]) == stepLocal_1) [L68] EXPR BOOL_unsigned_char_Array_0[1][0] [L68] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L95] EXPR BOOL_unsigned_char_Array_0[1][1] [L95] EXPR BOOL_unsigned_char_Array_0[1][0] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) [L95] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) [L95] EXPR float_Array_0[0] [L95] EXPR double_Array_0[0] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95-L96] return (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1165 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 11600 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9099 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1486 IncrementalHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2501 mSDtfsCounter, 1486 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=10, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 516 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1800 ConstructedInterpolants, 0 QuantifiedInterpolants, 3431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 4367/4488 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:36:59,774 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-a_file-54.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 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:37:01,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:37:01,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:37:01,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:37:01,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:37:02,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:37:02,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:37:02,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:37:02,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:37:02,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:37:02,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:37:02,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:37:02,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:37:02,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:37:02,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:37:02,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:37:02,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:37:02,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:37:02,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:37:02,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:37:02,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:37:02,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:37:02,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:37:02,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:37:02,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:37:02,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:37:02,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:37:02,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:37:02,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:37:02,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:37:02,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:37:02,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:37:02,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:37:02,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:37:02,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:02,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:37:02,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:37:02,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:37:02,050 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:37:02,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:37:02,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:37:02,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:37:02,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:37:02,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:37:02,052 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 -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2024-11-19 00:37:02,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:37:02,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:37:02,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:37:02,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:37:02,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:37:02,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-11-19 00:37:03,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:37:04,037 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:37:04,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-11-19 00:37:04,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a542cf5ba/809fdc0a7e8043e38984558ad8199310/FLAG691925b9c [2024-11-19 00:37:04,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a542cf5ba/809fdc0a7e8043e38984558ad8199310 [2024-11-19 00:37:04,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:37:04,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:37:04,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:04,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:37:04,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:37:04,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218b3b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04, skipping insertion in model container [2024-11-19 00:37:04,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:37:04,279 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-a_file-54.i[916,929] [2024-11-19 00:37:04,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:04,372 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:37:04,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2024-11-19 00:37:04,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:37:04,481 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:37:04,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04 WrapperNode [2024-11-19 00:37:04,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:37:04,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:04,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:37:04,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:37:04,490 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:37:04" (1/1) ... [2024-11-19 00:37:04,513 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:37:04" (1/1) ... [2024-11-19 00:37:04,550 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2024-11-19 00:37:04,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:37:04,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:37:04,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:37:04,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:37:04,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,609 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2024-11-19 00:37:04,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:37:04,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:37:04,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:37:04,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:37:04,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (1/1) ... [2024-11-19 00:37:04,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:37:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:37:04,722 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:37:04,726 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:37:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:37:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:37:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:37:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:37:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:37:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:37:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:37:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:37:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:37:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:37:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:37:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:37:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:37:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:37:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:37:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:37:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:37:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:37:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:37:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:37:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:37:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:37:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:37:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:37:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:37:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:37:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:37:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:37:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:37:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:37:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:37:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:37:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:37:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:37:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:37:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:37:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:37:04,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:37:04,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:37:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:37:04,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:37:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:37:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:37:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:37:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:37:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:37:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:37:04,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:37:04,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:37:06,119 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-19 00:37:06,119 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:37:06,132 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:37:06,132 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:37:06,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:06 BoogieIcfgContainer [2024-11-19 00:37:06,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:37:06,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:37:06,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:37:06,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:37:06,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:37:04" (1/3) ... [2024-11-19 00:37:06,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a685ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:06, skipping insertion in model container [2024-11-19 00:37:06,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:37:04" (2/3) ... [2024-11-19 00:37:06,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a685ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:37:06, skipping insertion in model container [2024-11-19 00:37:06,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:37:06" (3/3) ... [2024-11-19 00:37:06,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2024-11-19 00:37:06,156 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:37:06,156 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:37:06,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:37:06,216 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;@565cb210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:37:06,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:37:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:37:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:37:06,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:06,233 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:06,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -772808128, now seen corresponding path program 1 times [2024-11-19 00:37:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469792996] [2024-11-19 00:37:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:06,263 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:37:06,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:06,266 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:37:06,267 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:37:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:06,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:37:06,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-19 00:37:06,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:06,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469792996] [2024-11-19 00:37:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469792996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:06,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:06,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:37:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158652313] [2024-11-19 00:37:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:37:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:37:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:37:06,701 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:37:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:06,732 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-19 00:37:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:37:06,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-19 00:37:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:06,741 INFO L225 Difference]: With dead ends: 213 [2024-11-19 00:37:06,741 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:37:06,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:37:06,747 INFO L432 NwaCegarLoop]: 155 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, 155 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:37:06,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:37:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 00:37:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:37:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 00:37:06,787 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-19 00:37:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:06,787 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 00:37:06,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:37:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 00:37:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:37:06,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:06,790 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:06,802 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 (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:06,991 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:37:06,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:06,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1959980268, now seen corresponding path program 1 times [2024-11-19 00:37:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78686902] [2024-11-19 00:37:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:06,993 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:37:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:06,996 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:37:06,997 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:37:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:07,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:37:07,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:07,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:07,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:07,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78686902] [2024-11-19 00:37:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78686902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:07,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:37:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75927696] [2024-11-19 00:37:07,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:07,420 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:07,486 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-19 00:37:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:07,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 00:37:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:07,491 INFO L225 Difference]: With dead ends: 211 [2024-11-19 00:37:07,491 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 00:37:07,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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:37:07,493 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:07,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 00:37:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 00:37:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:37:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 00:37:07,515 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-19 00:37:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:07,517 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 00:37:07,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 00:37:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:37:07,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:07,520 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:07,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:07,721 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:37:07,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -963825561, now seen corresponding path program 1 times [2024-11-19 00:37:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415707994] [2024-11-19 00:37:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:07,723 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:37:07,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:07,724 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:37:07,725 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:37:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:08,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:37:08,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:08,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:08,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415707994] [2024-11-19 00:37:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415707994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:08,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:08,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:37:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652322575] [2024-11-19 00:37:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:08,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:08,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:37:08,083 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:08,251 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-19 00:37:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 00:37:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:08,256 INFO L225 Difference]: With dead ends: 218 [2024-11-19 00:37:08,256 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 00:37:08,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:37:08,259 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:08,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:37:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 00:37:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-19 00:37:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:37:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-19 00:37:08,270 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-19 00:37:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:08,271 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-19 00:37:08,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-19 00:37:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:37:08,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:08,273 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:08,282 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:37:08,474 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:37:08,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash 811181801, now seen corresponding path program 1 times [2024-11-19 00:37:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939148645] [2024-11-19 00:37:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:08,476 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:37:08,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:08,479 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:37:08,481 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:37:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:08,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:37:08,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:08,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:08,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939148645] [2024-11-19 00:37:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939148645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:37:08,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384690381] [2024-11-19 00:37:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:37:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:37:08,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:37:08,794 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:08,965 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2024-11-19 00:37:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:37:08,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 00:37:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:08,967 INFO L225 Difference]: With dead ends: 224 [2024-11-19 00:37:08,968 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 00:37:08,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:37:08,969 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:08,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:37:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 00:37:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 00:37:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:37:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-19 00:37:08,977 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2024-11-19 00:37:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:08,978 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-19 00:37:08,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-19 00:37:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:37:08,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:08,980 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:08,989 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:37:09,181 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:37:09,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:09,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash 813028843, now seen corresponding path program 1 times [2024-11-19 00:37:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:09,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476992433] [2024-11-19 00:37:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:09,182 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:37:09,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:09,185 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:37:09,186 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:37:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:09,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:37:09,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:09,547 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 23 treesize of output 11 [2024-11-19 00:37:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:09,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:09,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476992433] [2024-11-19 00:37:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476992433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:09,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:09,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:37:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359328498] [2024-11-19 00:37:09,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:37:09,608 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:10,036 INFO L93 Difference]: Finished difference Result 327 states and 470 transitions. [2024-11-19 00:37:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-19 00:37:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:10,039 INFO L225 Difference]: With dead ends: 327 [2024-11-19 00:37:10,039 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 00:37:10,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:37:10,040 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:10,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:37:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 00:37:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 135. [2024-11-19 00:37:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:37:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2024-11-19 00:37:10,063 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 107 [2024-11-19 00:37:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:10,063 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2024-11-19 00:37:10,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2024-11-19 00:37:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:37:10,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:10,068 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:10,077 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:10,268 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:37:10,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:10,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1898838398, now seen corresponding path program 1 times [2024-11-19 00:37:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:10,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644216180] [2024-11-19 00:37:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:10,270 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:37:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:10,273 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:37:10,274 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:37:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:10,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:37:10,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:10,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:37:10,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:37:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:10,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:10,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:10,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644216180] [2024-11-19 00:37:10,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644216180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:10,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:10,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:37:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462746034] [2024-11-19 00:37:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:37:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:37:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:37:10,859 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:10,974 INFO L93 Difference]: Finished difference Result 372 states and 540 transitions. [2024-11-19 00:37:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:37:10,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 00:37:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:10,977 INFO L225 Difference]: With dead ends: 372 [2024-11-19 00:37:10,977 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 00:37:10,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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:37:10,979 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:10,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 421 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:37:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 00:37:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2024-11-19 00:37:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 209 states have internal predecessors, (294), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:37:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2024-11-19 00:37:11,006 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 108 [2024-11-19 00:37:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:11,010 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2024-11-19 00:37:11,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2024-11-19 00:37:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:37:11,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:11,012 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,024 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 (7)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:11,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:11,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:11,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1081189948, now seen corresponding path program 1 times [2024-11-19 00:37:11,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:11,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265917953] [2024-11-19 00:37:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:11,214 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:37:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:11,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:37:11,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:37:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:11,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:37:11,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:11,503 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 23 treesize of output 11 [2024-11-19 00:37:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:11,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:11,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265917953] [2024-11-19 00:37:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265917953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:37:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163862803] [2024-11-19 00:37:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:11,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:37:11,525 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:12,055 INFO L93 Difference]: Finished difference Result 589 states and 855 transitions. [2024-11-19 00:37:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:37:12,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 00:37:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:12,058 INFO L225 Difference]: With dead ends: 589 [2024-11-19 00:37:12,058 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 00:37:12,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:37:12,059 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 144 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:12,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 539 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:37:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 00:37:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 251. [2024-11-19 00:37:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:37:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 364 transitions. [2024-11-19 00:37:12,077 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 364 transitions. Word has length 108 [2024-11-19 00:37:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:12,077 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 364 transitions. [2024-11-19 00:37:12,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 364 transitions. [2024-11-19 00:37:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:37:12,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:12,079 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:12,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:12,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 494383934, now seen corresponding path program 1 times [2024-11-19 00:37:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880278242] [2024-11-19 00:37:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:12,281 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:37:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:12,282 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:37:12,283 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:37:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:12,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:37:12,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:12,582 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 14 treesize of output 10 [2024-11-19 00:37:12,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-19 00:37:13,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2024-11-19 00:37:13,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:13,670 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 71 treesize of output 35 [2024-11-19 00:37:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 100 proven. 48 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 00:37:13,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:13,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880278242] [2024-11-19 00:37:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880278242] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-11-19 00:37:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660124595] [2024-11-19 00:37:13,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:13,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:37:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:13,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:37:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:37:13,893 INFO L87 Difference]: Start difference. First operand 251 states and 364 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:14,753 INFO L93 Difference]: Finished difference Result 623 states and 889 transitions. [2024-11-19 00:37:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:37:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-19 00:37:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:14,755 INFO L225 Difference]: With dead ends: 623 [2024-11-19 00:37:14,755 INFO L226 Difference]: Without dead ends: 375 [2024-11-19 00:37:14,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:37:14,757 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 67 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:14,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 682 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:37:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-19 00:37:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2024-11-19 00:37:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 338 states have (on average 1.3816568047337279) internal successors, (467), 340 states have internal predecessors, (467), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:37:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 523 transitions. [2024-11-19 00:37:14,780 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 523 transitions. Word has length 108 [2024-11-19 00:37:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:14,780 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 523 transitions. [2024-11-19 00:37:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 523 transitions. [2024-11-19 00:37:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:37:14,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:14,782 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:14,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:37:14,982 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:37:14,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:14,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash 9422404, now seen corresponding path program 1 times [2024-11-19 00:37:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824526439] [2024-11-19 00:37:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:14,984 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:37:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:14,986 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:37:14,986 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:37:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:15,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:37:15,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:37:15,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2024-11-19 00:37:15,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:15,436 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 38 treesize of output 20 [2024-11-19 00:37:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 00:37:15,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:15,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824526439] [2024-11-19 00:37:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824526439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:37:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371593313] [2024-11-19 00:37:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:15,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:37:15,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:37:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:37:15,457 INFO L87 Difference]: Start difference. First operand 371 states and 523 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:37:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:15,894 INFO L93 Difference]: Finished difference Result 1048 states and 1474 transitions. [2024-11-19 00:37:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:37:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 00:37:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:15,901 INFO L225 Difference]: With dead ends: 1048 [2024-11-19 00:37:15,901 INFO L226 Difference]: Without dead ends: 680 [2024-11-19 00:37:15,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:15,902 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 384 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:15,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 690 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:37:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-19 00:37:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2024-11-19 00:37:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 615 states have (on average 1.3707317073170733) internal successors, (843), 621 states have internal predecessors, (843), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 00:37:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 947 transitions. [2024-11-19 00:37:15,938 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 947 transitions. Word has length 109 [2024-11-19 00:37:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:15,939 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 947 transitions. [2024-11-19 00:37:15,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:37:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 947 transitions. [2024-11-19 00:37:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:37:15,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:15,941 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,952 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 (10)] Ended with exit code 0 [2024-11-19 00:37:16,144 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:37:16,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:16,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1001694846, now seen corresponding path program 1 times [2024-11-19 00:37:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569614106] [2024-11-19 00:37:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:16,146 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:37:16,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:16,147 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:37:16,148 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:37:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:16,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:37:16,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:16,383 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 14 treesize of output 10 [2024-11-19 00:37:16,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:37:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:16,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:16,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:16,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569614106] [2024-11-19 00:37:16,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569614106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:16,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:16,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:37:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075130786] [2024-11-19 00:37:16,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:16,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:37:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:37:16,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:37:16,467 INFO L87 Difference]: Start difference. First operand 676 states and 947 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:16,983 INFO L93 Difference]: Finished difference Result 1691 states and 2370 transitions. [2024-11-19 00:37:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:37:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 00:37:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:16,990 INFO L225 Difference]: With dead ends: 1691 [2024-11-19 00:37:16,990 INFO L226 Difference]: Without dead ends: 1018 [2024-11-19 00:37:16,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:37:16,992 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 141 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:16,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1517 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:37:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-19 00:37:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 699. [2024-11-19 00:37:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 626 states have (on average 1.3674121405750799) internal successors, (856), 633 states have internal predecessors, (856), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:37:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 980 transitions. [2024-11-19 00:37:17,064 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 980 transitions. Word has length 109 [2024-11-19 00:37:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:17,065 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 980 transitions. [2024-11-19 00:37:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 980 transitions. [2024-11-19 00:37:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:37:17,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:17,067 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,077 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 (11)] Ended with exit code 0 [2024-11-19 00:37:17,267 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:37:17,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:17,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:17,268 INFO L85 PathProgramCache]: Analyzing trace with hash 143435910, now seen corresponding path program 1 times [2024-11-19 00:37:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:17,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927797418] [2024-11-19 00:37:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:17,269 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:37:17,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:17,272 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:37:17,273 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:37:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:17,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:37:17,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:17,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-19 00:37:17,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:17,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 22 [2024-11-19 00:37:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:17,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:17,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927797418] [2024-11-19 00:37:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927797418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:17,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:17,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:37:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003962934] [2024-11-19 00:37:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:17,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:37:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:37:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:17,728 INFO L87 Difference]: Start difference. First operand 699 states and 980 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:18,316 INFO L93 Difference]: Finished difference Result 1606 states and 2247 transitions. [2024-11-19 00:37:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:37:18,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-19 00:37:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:18,322 INFO L225 Difference]: With dead ends: 1606 [2024-11-19 00:37:18,322 INFO L226 Difference]: Without dead ends: 949 [2024-11-19 00:37:18,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:37:18,325 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 129 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:18,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1924 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:37:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-19 00:37:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 679. [2024-11-19 00:37:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 606 states have (on average 1.3663366336633664) internal successors, (828), 613 states have internal predecessors, (828), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:37:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 952 transitions. [2024-11-19 00:37:18,375 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 952 transitions. Word has length 109 [2024-11-19 00:37:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:18,376 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 952 transitions. [2024-11-19 00:37:18,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 952 transitions. [2024-11-19 00:37:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:37:18,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:18,377 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:18,388 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 (12)] Ended with exit code 0 [2024-11-19 00:37:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:37:18,578 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:18,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1465883152, now seen corresponding path program 1 times [2024-11-19 00:37:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236834989] [2024-11-19 00:37:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:18,579 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:37:18,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:18,582 INFO L229 MonitoredProcess]: Starting monitored process 13 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:37:18,583 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 (13)] Waiting until timeout for monitored process [2024-11-19 00:37:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:18,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:37:18,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:18,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:37:18,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-19 00:37:19,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:19,044 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 57 treesize of output 27 [2024-11-19 00:37:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:37:19,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:19,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:19,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236834989] [2024-11-19 00:37:19,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236834989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:19,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:37:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661714356] [2024-11-19 00:37:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:19,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:37:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:37:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:37:19,072 INFO L87 Difference]: Start difference. First operand 679 states and 952 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:19,192 INFO L93 Difference]: Finished difference Result 721 states and 997 transitions. [2024-11-19 00:37:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:37:19,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-19 00:37:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:19,195 INFO L225 Difference]: With dead ends: 721 [2024-11-19 00:37:19,195 INFO L226 Difference]: Without dead ends: 719 [2024-11-19 00:37:19,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:37:19,196 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:19,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:37:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-19 00:37:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2024-11-19 00:37:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 642 states have (on average 1.3457943925233644) internal successors, (864), 649 states have internal predecessors, (864), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:37:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 988 transitions. [2024-11-19 00:37:19,236 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 988 transitions. Word has length 110 [2024-11-19 00:37:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 988 transitions. [2024-11-19 00:37:19,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:37:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 988 transitions. [2024-11-19 00:37:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:37:19,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:19,238 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:19,249 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 (13)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:19,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:37:19,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1467730194, now seen corresponding path program 1 times [2024-11-19 00:37:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959742420] [2024-11-19 00:37:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:19,440 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:37:19,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:19,441 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:37:19,442 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:37:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:20,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:37:20,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:20,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:37:20,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:20,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 67 [2024-11-19 00:37:23,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:37:33,851 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 203 treesize of output 167 [2024-11-19 00:37:33,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:33,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 121 [2024-11-19 00:37:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:37:34,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:37:34,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959742420] [2024-11-19 00:37:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959742420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:37:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:37:34,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:37:34,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148149975] [2024-11-19 00:37:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:37:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:34,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:37:34,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2024-11-19 00:37:34,391 INFO L87 Difference]: Start difference. First operand 719 states and 988 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:37:38,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:37:42,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:37:44,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:37:46,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:37:48,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:37:51,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:37:56,669 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 [0] [2024-11-19 00:38:01,384 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 [0]