./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd --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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:13:01,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:13:01,766 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:13:01,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:13:01,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:13:01,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:13:01,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:13:01,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:13:01,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:13:01,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:13:01,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:13:01,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:13:01,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:13:01,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:13:01,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:13:01,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:13:01,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:13:01,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:13:01,819 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd 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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2024-11-13 16:13:02,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:13:02,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:13:02,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:13:02,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:13:02,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:13:02,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i Unable to find full path for "g++" [2024-11-13 16:13:04,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:13:04,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:13:04,526 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2024-11-13 16:13:04,535 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data/7a3f92b64/cef7ca0681104e29a7d78dc58c792b15/FLAG4bd0d3cb9 [2024-11-13 16:13:04,550 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data/7a3f92b64/cef7ca0681104e29a7d78dc58c792b15 [2024-11-13 16:13:04,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:13:04,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:13:04,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:13:04,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:13:04,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:13:04,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:04,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18674f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04, skipping insertion in model container [2024-11-13 16:13:04,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:04,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:13:04,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2024-11-13 16:13:04,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:13:04,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:13:04,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2024-11-13 16:13:04,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:13:04,862 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:13:04,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04 WrapperNode [2024-11-13 16:13:04,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:13:04,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:13:04,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:13:04,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:13:04,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:04,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:04,939 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-13 16:13:04,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:13:04,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:13:04,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:13:04,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:13:04,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:04,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:04,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,003 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-13 16:13:05,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:13:05,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:13:05,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:13:05,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:13:05,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (1/1) ... [2024-11-13 16:13:05,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:13:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:13:05,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:13:05,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:13:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:13:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:13:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 16:13:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 16:13:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 16:13:05,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 16:13:05,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 16:13:05,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 16:13:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 16:13:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 16:13:05,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 16:13:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 16:13:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:13:05,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:13:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:13:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:13:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:13:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 16:13:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 16:13:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 16:13:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:13:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:13:05,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:13:05,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:13:05,974 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-13 16:13:05,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:13:05,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:13:05,995 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:13:05,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:05 BoogieIcfgContainer [2024-11-13 16:13:05,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:13:05,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:13:05,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:13:06,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:13:06,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:13:04" (1/3) ... [2024-11-13 16:13:06,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546a388e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:13:06, skipping insertion in model container [2024-11-13 16:13:06,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:04" (2/3) ... [2024-11-13 16:13:06,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546a388e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:13:06, skipping insertion in model container [2024-11-13 16:13:06,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:05" (3/3) ... [2024-11-13 16:13:06,007 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2024-11-13 16:13:06,048 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:13:06,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-15.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:13:06,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:13:06,121 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;@7d68052f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:13:06,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:13:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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-13 16:13:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:06,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:06,138 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, 1, 1, 1, 1, 1] [2024-11-13 16:13:06,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:06,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash 357738169, now seen corresponding path program 1 times [2024-11-13 16:13:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286346662] [2024-11-13 16:13:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,589 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-13 16:13:06,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286346662] [2024-11-13 16:13:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286346662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:06,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:13:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197777310] [2024-11-13 16:13:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:13:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:13:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:13:06,622 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-13 16:13:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:06,667 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-13 16:13:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:13:06,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 115 [2024-11-13 16:13:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:06,679 INFO L225 Difference]: With dead ends: 219 [2024-11-13 16:13:06,679 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 16:13:06,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-13 16:13:06,689 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:06,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 16:13:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 16:13:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 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-13 16:13:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 16:13:06,737 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 16:13:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:06,739 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 16:13:06,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-13 16:13:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 16:13:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:06,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:06,743 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, 1, 1, 1, 1, 1] [2024-11-13 16:13:06,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:13:06,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1502558233, now seen corresponding path program 1 times [2024-11-13 16:13:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467090439] [2024-11-13 16:13:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,087 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-13 16:13:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467090439] [2024-11-13 16:13:07,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467090439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:07,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:13:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409643755] [2024-11-13 16:13:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:07,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:13:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:13:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:07,090 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:13:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:07,126 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-13 16:13:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:13:07,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2024-11-13 16:13:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:07,132 INFO L225 Difference]: With dead ends: 216 [2024-11-13 16:13:07,132 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 16:13:07,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:07,133 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:07,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 16:13:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-13 16:13:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 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-13 16:13:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-13 16:13:07,149 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 115 [2024-11-13 16:13:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:07,151 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-13 16:13:07,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:13:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-13 16:13:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:07,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:07,153 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, 1, 1, 1, 1, 1] [2024-11-13 16:13:07,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:13:07,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:07,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1103465321, now seen corresponding path program 1 times [2024-11-13 16:13:07,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:07,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093297639] [2024-11-13 16:13:07,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:07,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,559 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-13 16:13:07,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093297639] [2024-11-13 16:13:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093297639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:07,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:13:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899921172] [2024-11-13 16:13:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:07,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:13:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:13:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:07,564 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:13:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:07,610 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2024-11-13 16:13:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:13:07,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2024-11-13 16:13:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:07,616 INFO L225 Difference]: With dead ends: 215 [2024-11-13 16:13:07,616 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 16:13:07,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:07,617 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:07,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 16:13:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 16:13:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 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-13 16:13:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-13 16:13:07,635 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2024-11-13 16:13:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:07,636 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-13 16:13:07,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:13:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-13 16:13:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:07,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:07,640 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, 1, 1, 1, 1, 1] [2024-11-13 16:13:07,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:13:07,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:07,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 975301554, now seen corresponding path program 1 times [2024-11-13 16:13:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724295925] [2024-11-13 16:13:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,870 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-13 16:13:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724295925] [2024-11-13 16:13:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724295925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:13:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111559336] [2024-11-13 16:13:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:07,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:13:07,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:13:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:07,875 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:13:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:07,911 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2024-11-13 16:13:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:13:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2024-11-13 16:13:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:07,916 INFO L225 Difference]: With dead ends: 214 [2024-11-13 16:13:07,916 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 16:13:07,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:07,917 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:07,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 16:13:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 16:13:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 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-13 16:13:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-13 16:13:07,932 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 115 [2024-11-13 16:13:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:07,933 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-13 16:13:07,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:13:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-13 16:13:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:07,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:07,938 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, 1, 1, 1, 1, 1] [2024-11-13 16:13:07,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:13:07,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:07,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1233466992, now seen corresponding path program 1 times [2024-11-13 16:13:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:07,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152102594] [2024-11-13 16:13:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,508 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-13 16:13:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152102594] [2024-11-13 16:13:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152102594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026624907] [2024-11-13 16:13:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:08,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:08,510 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-13 16:13:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:08,786 INFO L93 Difference]: Finished difference Result 427 states and 611 transitions. [2024-11-13 16:13:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:13:08,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 115 [2024-11-13 16:13:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:08,790 INFO L225 Difference]: With dead ends: 427 [2024-11-13 16:13:08,791 INFO L226 Difference]: Without dead ends: 321 [2024-11-13 16:13:08,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:08,796 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 244 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:08,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 919 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-13 16:13:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2024-11-13 16:13:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 183 states have (on average 1.3825136612021858) internal successors, (253), 183 states have internal predecessors, (253), 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-13 16:13:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2024-11-13 16:13:08,849 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 115 [2024-11-13 16:13:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:08,850 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2024-11-13 16:13:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-13 16:13:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2024-11-13 16:13:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:13:08,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:08,852 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:08,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:13:08,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:08,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1340057636, now seen corresponding path program 1 times [2024-11-13 16:13:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986796444] [2024-11-13 16:13:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:08,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,249 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-13 16:13:09,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:09,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986796444] [2024-11-13 16:13:09,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986796444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:09,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:09,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700351545] [2024-11-13 16:13:09,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:09,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:09,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:09,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:09,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:09,252 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-13 16:13:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:09,328 INFO L93 Difference]: Finished difference Result 421 states and 603 transitions. [2024-11-13 16:13:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:13:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 117 [2024-11-13 16:13:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:09,334 INFO L225 Difference]: With dead ends: 421 [2024-11-13 16:13:09,334 INFO L226 Difference]: Without dead ends: 214 [2024-11-13 16:13:09,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-13 16:13:09,335 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 102 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:09,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 504 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-13 16:13:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2024-11-13 16:13:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 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-13 16:13:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 299 transitions. [2024-11-13 16:13:09,363 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 299 transitions. Word has length 117 [2024-11-13 16:13:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:09,364 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 299 transitions. [2024-11-13 16:13:09,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-13 16:13:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 299 transitions. [2024-11-13 16:13:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:13:09,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:09,366 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:13:09,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash -167850613, now seen corresponding path program 1 times [2024-11-13 16:13:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219675553] [2024-11-13 16:13:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,127 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-13 16:13:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219675553] [2024-11-13 16:13:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219675553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:10,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465250074] [2024-11-13 16:13:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:10,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:10,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:10,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:10,130 INFO L87 Difference]: Start difference. First operand 209 states and 299 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-13 16:13:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:10,292 INFO L93 Difference]: Finished difference Result 478 states and 683 transitions. [2024-11-13 16:13:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:13:10,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 117 [2024-11-13 16:13:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:10,296 INFO L225 Difference]: With dead ends: 478 [2024-11-13 16:13:10,296 INFO L226 Difference]: Without dead ends: 372 [2024-11-13 16:13:10,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:10,297 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 110 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:10,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1093 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-13 16:13:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2024-11-13 16:13:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 323 states have (on average 1.3839009287925697) internal successors, (447), 325 states have internal predecessors, (447), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 16:13:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 527 transitions. [2024-11-13 16:13:10,339 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 527 transitions. Word has length 117 [2024-11-13 16:13:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:10,340 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 527 transitions. [2024-11-13 16:13:10,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-13 16:13:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 527 transitions. [2024-11-13 16:13:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:10,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:10,342 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:13:10,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:10,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1878599341, now seen corresponding path program 1 times [2024-11-13 16:13:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:10,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107611951] [2024-11-13 16:13:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:10,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:10,904 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-13 16:13:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107611951] [2024-11-13 16:13:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107611951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:10,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:10,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:13:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820406589] [2024-11-13 16:13:10,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:10,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:13:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:13:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:10,906 INFO L87 Difference]: Start difference. First operand 368 states and 527 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-13 16:13:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:11,209 INFO L93 Difference]: Finished difference Result 945 states and 1355 transitions. [2024-11-13 16:13:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 118 [2024-11-13 16:13:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:11,218 INFO L225 Difference]: With dead ends: 945 [2024-11-13 16:13:11,218 INFO L226 Difference]: Without dead ends: 580 [2024-11-13 16:13:11,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:11,220 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 142 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:11,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1792 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-13 16:13:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2024-11-13 16:13:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 507 states have (on average 1.3806706114398422) internal successors, (700), 509 states have internal predecessors, (700), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 828 transitions. [2024-11-13 16:13:11,278 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 828 transitions. Word has length 118 [2024-11-13 16:13:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 828 transitions. [2024-11-13 16:13:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-13 16:13:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 828 transitions. [2024-11-13 16:13:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:11,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:11,282 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:11,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:13:11,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:11,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2121387100, now seen corresponding path program 1 times [2024-11-13 16:13:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662921200] [2024-11-13 16:13:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:11,983 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-13 16:13:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662921200] [2024-11-13 16:13:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662921200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:11,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:11,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:11,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668973396] [2024-11-13 16:13:11,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:11,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:11,985 INFO L87 Difference]: Start difference. First operand 578 states and 828 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-13 16:13:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:12,213 INFO L93 Difference]: Finished difference Result 1480 states and 2095 transitions. [2024-11-13 16:13:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 118 [2024-11-13 16:13:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:12,221 INFO L225 Difference]: With dead ends: 1480 [2024-11-13 16:13:12,221 INFO L226 Difference]: Without dead ends: 905 [2024-11-13 16:13:12,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:12,224 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 67 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:12,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 810 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-13 16:13:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 894. [2024-11-13 16:13:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 805 states have (on average 1.368944099378882) internal successors, (1102), 813 states have internal predecessors, (1102), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 16:13:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1254 transitions. [2024-11-13 16:13:12,296 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1254 transitions. Word has length 118 [2024-11-13 16:13:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:12,296 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1254 transitions. [2024-11-13 16:13:12,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-13 16:13:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1254 transitions. [2024-11-13 16:13:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:12,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:12,304 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:12,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:13:12,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:12,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash 224721115, now seen corresponding path program 1 times [2024-11-13 16:13:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:12,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439216165] [2024-11-13 16:13:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:12,881 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-13 16:13:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439216165] [2024-11-13 16:13:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439216165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:12,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:12,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:12,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223935014] [2024-11-13 16:13:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:12,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:12,884 INFO L87 Difference]: Start difference. First operand 894 states and 1254 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-13 16:13:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:13,061 INFO L93 Difference]: Finished difference Result 1377 states and 1913 transitions. [2024-11-13 16:13:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:13,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 118 [2024-11-13 16:13:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:13,067 INFO L225 Difference]: With dead ends: 1377 [2024-11-13 16:13:13,067 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 16:13:13,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:13,070 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 75 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:13,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 879 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 16:13:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 668. [2024-11-13 16:13:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 591 states have (on average 1.3604060913705585) internal successors, (804), 593 states have internal predecessors, (804), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 932 transitions. [2024-11-13 16:13:13,140 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 932 transitions. Word has length 118 [2024-11-13 16:13:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:13,142 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 932 transitions. [2024-11-13 16:13:13,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-13 16:13:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 932 transitions. [2024-11-13 16:13:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:13,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:13,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:13,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:13:13,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash 658363501, now seen corresponding path program 1 times [2024-11-13 16:13:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142523161] [2024-11-13 16:13:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,644 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-13 16:13:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142523161] [2024-11-13 16:13:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142523161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:13,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531131986] [2024-11-13 16:13:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:13,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:13,646 INFO L87 Difference]: Start difference. First operand 668 states and 932 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:13,842 INFO L93 Difference]: Finished difference Result 1443 states and 2004 transitions. [2024-11-13 16:13:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 119 [2024-11-13 16:13:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:13,846 INFO L225 Difference]: With dead ends: 1443 [2024-11-13 16:13:13,847 INFO L226 Difference]: Without dead ends: 778 [2024-11-13 16:13:13,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:13,849 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 77 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:13,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 784 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-13 16:13:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 632. [2024-11-13 16:13:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 555 states have (on average 1.3603603603603605) internal successors, (755), 557 states have internal predecessors, (755), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 883 transitions. [2024-11-13 16:13:13,905 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 883 transitions. Word has length 119 [2024-11-13 16:13:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:13,905 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 883 transitions. [2024-11-13 16:13:13,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 883 transitions. [2024-11-13 16:13:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:13,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:13,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:13:13,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:13,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1001397121, now seen corresponding path program 1 times [2024-11-13 16:13:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:13,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549128449] [2024-11-13 16:13:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,376 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-13 16:13:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549128449] [2024-11-13 16:13:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549128449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834123612] [2024-11-13 16:13:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:14,378 INFO L87 Difference]: Start difference. First operand 632 states and 883 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:14,573 INFO L93 Difference]: Finished difference Result 1110 states and 1535 transitions. [2024-11-13 16:13:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:14,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 119 [2024-11-13 16:13:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:14,579 INFO L225 Difference]: With dead ends: 1110 [2024-11-13 16:13:14,579 INFO L226 Difference]: Without dead ends: 770 [2024-11-13 16:13:14,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:14,581 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 71 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:14,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 878 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-13 16:13:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 630. [2024-11-13 16:13:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 553 states have (on average 1.3544303797468353) internal successors, (749), 555 states have internal predecessors, (749), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 877 transitions. [2024-11-13 16:13:14,642 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 877 transitions. Word has length 119 [2024-11-13 16:13:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:14,643 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 877 transitions. [2024-11-13 16:13:14,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 877 transitions. [2024-11-13 16:13:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:14,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:14,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:14,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:13:14,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:14,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash 373274134, now seen corresponding path program 1 times [2024-11-13 16:13:14,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:14,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082948905] [2024-11-13 16:13:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:14,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,133 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-13 16:13:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:15,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082948905] [2024-11-13 16:13:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082948905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:15,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:15,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629896841] [2024-11-13 16:13:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:15,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:15,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:15,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:15,136 INFO L87 Difference]: Start difference. First operand 630 states and 877 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:15,287 INFO L93 Difference]: Finished difference Result 1393 states and 1929 transitions. [2024-11-13 16:13:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 119 [2024-11-13 16:13:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:15,293 INFO L225 Difference]: With dead ends: 1393 [2024-11-13 16:13:15,293 INFO L226 Difference]: Without dead ends: 766 [2024-11-13 16:13:15,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:15,296 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 140 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:15,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 566 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-13 16:13:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 628. [2024-11-13 16:13:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 551 states have (on average 1.3484573502722323) internal successors, (743), 553 states have internal predecessors, (743), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 871 transitions. [2024-11-13 16:13:15,355 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 871 transitions. Word has length 119 [2024-11-13 16:13:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:15,356 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 871 transitions. [2024-11-13 16:13:15,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 871 transitions. [2024-11-13 16:13:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:15,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:15,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:15,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:13:15,358 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:15,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1432164200, now seen corresponding path program 1 times [2024-11-13 16:13:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:15,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447293860] [2024-11-13 16:13:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,805 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-13 16:13:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447293860] [2024-11-13 16:13:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447293860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:15,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044172921] [2024-11-13 16:13:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:15,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:15,807 INFO L87 Difference]: Start difference. First operand 628 states and 871 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:15,970 INFO L93 Difference]: Finished difference Result 1388 states and 1916 transitions. [2024-11-13 16:13:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 119 [2024-11-13 16:13:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:15,977 INFO L225 Difference]: With dead ends: 1388 [2024-11-13 16:13:15,977 INFO L226 Difference]: Without dead ends: 763 [2024-11-13 16:13:15,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:15,979 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 120 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:15,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 565 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-13 16:13:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 628. [2024-11-13 16:13:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 551 states have (on average 1.337568058076225) internal successors, (737), 553 states have internal predecessors, (737), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 865 transitions. [2024-11-13 16:13:16,057 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 865 transitions. Word has length 119 [2024-11-13 16:13:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:16,058 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 865 transitions. [2024-11-13 16:13:16,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-13 16:13:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 865 transitions. [2024-11-13 16:13:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:16,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:16,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:13:16,060 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1851685846, now seen corresponding path program 1 times [2024-11-13 16:13:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426766436] [2024-11-13 16:13:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,261 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-13 16:13:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:17,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426766436] [2024-11-13 16:13:17,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426766436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:17,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:17,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 16:13:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032995615] [2024-11-13 16:13:17,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:17,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:13:17,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:17,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:13:17,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:17,263 INFO L87 Difference]: Start difference. First operand 628 states and 865 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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-13 16:13:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:18,868 INFO L93 Difference]: Finished difference Result 1426 states and 1962 transitions. [2024-11-13 16:13:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:13:18,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 119 [2024-11-13 16:13:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:18,873 INFO L225 Difference]: With dead ends: 1426 [2024-11-13 16:13:18,873 INFO L226 Difference]: Without dead ends: 801 [2024-11-13 16:13:18,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2024-11-13 16:13:18,875 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 410 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:18,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 2121 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 16:13:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-13 16:13:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 636. [2024-11-13 16:13:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 559 states have (on average 1.3309481216457961) internal successors, (744), 561 states have internal predecessors, (744), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 872 transitions. [2024-11-13 16:13:18,948 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 872 transitions. Word has length 119 [2024-11-13 16:13:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:18,950 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 872 transitions. [2024-11-13 16:13:18,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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-13 16:13:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 872 transitions. [2024-11-13 16:13:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:13:18,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:18,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:18,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:13:18,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -527847125, now seen corresponding path program 1 times [2024-11-13 16:13:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745488669] [2024-11-13 16:13:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,019 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-13 16:13:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745488669] [2024-11-13 16:13:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745488669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:13:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728269535] [2024-11-13 16:13:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:13:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:20,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:13:20,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:20,021 INFO L87 Difference]: Start difference. First operand 636 states and 872 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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-13 16:13:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:20,826 INFO L93 Difference]: Finished difference Result 1429 states and 1959 transitions. [2024-11-13 16:13:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:13:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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 120 [2024-11-13 16:13:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:20,831 INFO L225 Difference]: With dead ends: 1429 [2024-11-13 16:13:20,832 INFO L226 Difference]: Without dead ends: 796 [2024-11-13 16:13:20,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:13:20,835 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 250 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:20,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1387 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:13:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-13 16:13:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 636. [2024-11-13 16:13:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 559 states have (on average 1.329159212880143) internal successors, (743), 561 states have internal predecessors, (743), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:13:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 871 transitions. [2024-11-13 16:13:20,901 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 871 transitions. Word has length 120 [2024-11-13 16:13:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:20,902 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 871 transitions. [2024-11-13 16:13:20,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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-13 16:13:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 871 transitions. [2024-11-13 16:13:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:13:20,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:20,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:20,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:13:20,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:20,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1083205128, now seen corresponding path program 1 times [2024-11-13 16:13:20,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:20,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522578280] [2024-11-13 16:13:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,818 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-13 16:13:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:22,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522578280] [2024-11-13 16:13:22,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522578280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:22,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:22,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 16:13:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614497047] [2024-11-13 16:13:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:22,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:13:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:22,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:13:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:13:22,822 INFO L87 Difference]: Start difference. First operand 636 states and 871 transitions. Second operand has 19 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 16:13:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:25,985 INFO L93 Difference]: Finished difference Result 2106 states and 2890 transitions. [2024-11-13 16:13:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:13:25,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2024-11-13 16:13:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:25,994 INFO L225 Difference]: With dead ends: 2106 [2024-11-13 16:13:25,994 INFO L226 Difference]: Without dead ends: 1770 [2024-11-13 16:13:25,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 16:13:25,996 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 944 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 3689 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:25,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 3689 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 16:13:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-13 16:13:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1235. [2024-11-13 16:13:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1085 states have (on average 1.3336405529953916) internal successors, (1447), 1091 states have internal predecessors, (1447), 124 states have call successors, (124), 25 states have call predecessors, (124), 25 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-13 16:13:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1695 transitions. [2024-11-13 16:13:26,127 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1695 transitions. Word has length 121 [2024-11-13 16:13:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:26,127 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1695 transitions. [2024-11-13 16:13:26,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 16:13:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1695 transitions. [2024-11-13 16:13:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:13:26,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:26,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:26,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:13:26,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:26,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1145244742, now seen corresponding path program 1 times [2024-11-13 16:13:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123475192] [2024-11-13 16:13:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:27,559 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-13 16:13:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123475192] [2024-11-13 16:13:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123475192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:27,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 16:13:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554267960] [2024-11-13 16:13:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:27,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 16:13:27,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 16:13:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:13:27,560 INFO L87 Difference]: Start difference. First operand 1235 states and 1695 transitions. Second operand has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 16:13:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:30,621 INFO L93 Difference]: Finished difference Result 2214 states and 3039 transitions. [2024-11-13 16:13:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:13:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2024-11-13 16:13:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:30,631 INFO L225 Difference]: With dead ends: 2214 [2024-11-13 16:13:30,631 INFO L226 Difference]: Without dead ends: 1816 [2024-11-13 16:13:30,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2024-11-13 16:13:30,633 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 627 mSDsluCounter, 3034 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:30,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 3374 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 16:13:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-13 16:13:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1261. [2024-11-13 16:13:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1111 states have (on average 1.3285328532853284) internal successors, (1476), 1117 states have internal predecessors, (1476), 124 states have call successors, (124), 25 states have call predecessors, (124), 25 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-13 16:13:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1724 transitions. [2024-11-13 16:13:30,793 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1724 transitions. Word has length 121 [2024-11-13 16:13:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1724 transitions. [2024-11-13 16:13:30,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 16:13:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1724 transitions. [2024-11-13 16:13:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:13:30,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:30,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:30,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 16:13:30,797 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:30,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -618556933, now seen corresponding path program 1 times [2024-11-13 16:13:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796863163] [2024-11-13 16:13:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,154 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-13 16:13:31,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796863163] [2024-11-13 16:13:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796863163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:31,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:31,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:13:31,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050779812] [2024-11-13 16:13:31,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:31,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:13:31,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:31,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:13:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:31,155 INFO L87 Difference]: Start difference. First operand 1261 states and 1724 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-13 16:13:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:31,449 INFO L93 Difference]: Finished difference Result 2811 states and 3841 transitions. [2024-11-13 16:13:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:13:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 121 [2024-11-13 16:13:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:31,456 INFO L225 Difference]: With dead ends: 2811 [2024-11-13 16:13:31,457 INFO L226 Difference]: Without dead ends: 1553 [2024-11-13 16:13:31,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:31,460 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 109 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:31,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1349 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2024-11-13 16:13:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1312. [2024-11-13 16:13:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1162 states have (on average 1.3184165232358003) internal successors, (1532), 1168 states have internal predecessors, (1532), 124 states have call successors, (124), 25 states have call predecessors, (124), 25 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-13 16:13:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1780 transitions. [2024-11-13 16:13:31,582 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1780 transitions. Word has length 121 [2024-11-13 16:13:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:31,582 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1780 transitions. [2024-11-13 16:13:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-13 16:13:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1780 transitions. [2024-11-13 16:13:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:13:31,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:31,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:31,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 16:13:31,585 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:31,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash -399702215, now seen corresponding path program 1 times [2024-11-13 16:13:31,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:31,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594984636] [2024-11-13 16:13:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:32,065 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-13 16:13:32,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594984636] [2024-11-13 16:13:32,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594984636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:32,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498017613] [2024-11-13 16:13:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:32,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:32,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:32,068 INFO L87 Difference]: Start difference. First operand 1312 states and 1780 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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-13 16:13:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:32,309 INFO L93 Difference]: Finished difference Result 2795 states and 3792 transitions. [2024-11-13 16:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:32,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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 121 [2024-11-13 16:13:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:32,316 INFO L225 Difference]: With dead ends: 2795 [2024-11-13 16:13:32,317 INFO L226 Difference]: Without dead ends: 1486 [2024-11-13 16:13:32,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-13 16:13:32,320 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 49 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:32,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 888 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-13 16:13:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1300. [2024-11-13 16:13:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1150 states have (on average 1.3121739130434782) internal successors, (1509), 1156 states have internal predecessors, (1509), 124 states have call successors, (124), 25 states have call predecessors, (124), 25 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-13 16:13:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1757 transitions. [2024-11-13 16:13:32,440 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1757 transitions. Word has length 121 [2024-11-13 16:13:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:32,441 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1757 transitions. [2024-11-13 16:13:32,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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-13 16:13:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1757 transitions. [2024-11-13 16:13:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:13:32,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:32,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 16:13:32,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1160259069, now seen corresponding path program 1 times [2024-11-13 16:13:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116061714] [2024-11-13 16:13:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:33,467 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-13 16:13:33,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116061714] [2024-11-13 16:13:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116061714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:33,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:13:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078843964] [2024-11-13 16:13:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:33,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:13:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:33,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:13:33,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:33,471 INFO L87 Difference]: Start difference. First operand 1300 states and 1757 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:13:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:35,217 INFO L93 Difference]: Finished difference Result 2267 states and 3065 transitions. [2024-11-13 16:13:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:13:35,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-11-13 16:13:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:35,225 INFO L225 Difference]: With dead ends: 2267 [2024-11-13 16:13:35,225 INFO L226 Difference]: Without dead ends: 1781 [2024-11-13 16:13:35,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:13:35,228 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 446 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:35,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1766 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 16:13:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2024-11-13 16:13:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1502. [2024-11-13 16:13:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1317 states have (on average 1.3090356871678057) internal successors, (1724), 1325 states have internal predecessors, (1724), 152 states have call successors, (152), 32 states have call predecessors, (152), 32 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2028 transitions. [2024-11-13 16:13:35,419 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2028 transitions. Word has length 122 [2024-11-13 16:13:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:35,419 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2028 transitions. [2024-11-13 16:13:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:13:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2028 transitions. [2024-11-13 16:13:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:13:35,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:35,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:35,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 16:13:35,421 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:35,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:35,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1211480193, now seen corresponding path program 1 times [2024-11-13 16:13:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558220168] [2024-11-13 16:13:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:36,859 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-13 16:13:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558220168] [2024-11-13 16:13:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558220168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 16:13:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914147420] [2024-11-13 16:13:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:36,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:13:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:13:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:36,860 INFO L87 Difference]: Start difference. First operand 1502 states and 2028 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 16:13:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:40,015 INFO L93 Difference]: Finished difference Result 2470 states and 3343 transitions. [2024-11-13 16:13:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:13:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-11-13 16:13:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:40,024 INFO L225 Difference]: With dead ends: 2470 [2024-11-13 16:13:40,024 INFO L226 Difference]: Without dead ends: 1889 [2024-11-13 16:13:40,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-13 16:13:40,029 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 490 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:40,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1833 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 16:13:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-11-13 16:13:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1482. [2024-11-13 16:13:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1297 states have (on average 1.3099460292983809) internal successors, (1699), 1305 states have internal predecessors, (1699), 152 states have call successors, (152), 32 states have call predecessors, (152), 32 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2003 transitions. [2024-11-13 16:13:40,254 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2003 transitions. Word has length 122 [2024-11-13 16:13:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:40,254 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2003 transitions. [2024-11-13 16:13:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 16:13:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2003 transitions. [2024-11-13 16:13:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:13:40,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:40,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:40,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 16:13:40,257 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1979183329, now seen corresponding path program 1 times [2024-11-13 16:13:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062938892] [2024-11-13 16:13:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,601 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-13 16:13:40,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:40,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062938892] [2024-11-13 16:13:40,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062938892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571389406] [2024-11-13 16:13:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:40,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:40,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:40,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:40,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:40,603 INFO L87 Difference]: Start difference. First operand 1482 states and 2003 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-13 16:13:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:40,881 INFO L93 Difference]: Finished difference Result 3043 states and 4111 transitions. [2024-11-13 16:13:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:40,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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 122 [2024-11-13 16:13:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:40,888 INFO L225 Difference]: With dead ends: 3043 [2024-11-13 16:13:40,889 INFO L226 Difference]: Without dead ends: 1564 [2024-11-13 16:13:40,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:40,892 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:40,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 695 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-13 16:13:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1490. [2024-11-13 16:13:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1305 states have (on average 1.30727969348659) internal successors, (1706), 1313 states have internal predecessors, (1706), 152 states have call successors, (152), 32 states have call predecessors, (152), 32 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2010 transitions. [2024-11-13 16:13:41,104 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2010 transitions. Word has length 122 [2024-11-13 16:13:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:41,104 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 2010 transitions. [2024-11-13 16:13:41,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-13 16:13:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2010 transitions. [2024-11-13 16:13:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:13:41,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:41,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:41,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 16:13:41,107 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:41,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753450, now seen corresponding path program 1 times [2024-11-13 16:13:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409232448] [2024-11-13 16:13:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,484 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-13 16:13:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:42,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409232448] [2024-11-13 16:13:42,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409232448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:42,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:42,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 16:13:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208628773] [2024-11-13 16:13:42,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:42,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 16:13:42,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:42,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 16:13:42,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:13:42,486 INFO L87 Difference]: Start difference. First operand 1490 states and 2010 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 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-13 16:13:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:43,912 INFO L93 Difference]: Finished difference Result 3255 states and 4387 transitions. [2024-11-13 16:13:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:13:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 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 122 [2024-11-13 16:13:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:43,921 INFO L225 Difference]: With dead ends: 3255 [2024-11-13 16:13:43,921 INFO L226 Difference]: Without dead ends: 1768 [2024-11-13 16:13:43,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2024-11-13 16:13:43,925 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 370 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:43,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 2802 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:13:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-13 16:13:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1762. [2024-11-13 16:13:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1543 states have (on average 1.3026571613739468) internal successors, (2010), 1554 states have internal predecessors, (2010), 180 states have call successors, (180), 38 states have call predecessors, (180), 38 states have return successors, (180), 169 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-13 16:13:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2370 transitions. [2024-11-13 16:13:44,177 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2370 transitions. Word has length 122 [2024-11-13 16:13:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:44,178 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2370 transitions. [2024-11-13 16:13:44,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 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-13 16:13:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2370 transitions. [2024-11-13 16:13:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:13:44,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:44,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 16:13:44,180 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:44,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2014613972, now seen corresponding path program 1 times [2024-11-13 16:13:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769706233] [2024-11-13 16:13:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,176 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-13 16:13:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769706233] [2024-11-13 16:13:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769706233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:13:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75008711] [2024-11-13 16:13:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:45,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:13:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:13:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:45,178 INFO L87 Difference]: Start difference. First operand 1762 states and 2370 transitions. Second operand has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:13:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:47,434 INFO L93 Difference]: Finished difference Result 3577 states and 4811 transitions. [2024-11-13 16:13:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:13:47,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-11-13 16:13:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:47,443 INFO L225 Difference]: With dead ends: 3577 [2024-11-13 16:13:47,443 INFO L226 Difference]: Without dead ends: 1818 [2024-11-13 16:13:47,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:13:47,447 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 838 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:47,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1124 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 16:13:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-13 16:13:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1579. [2024-11-13 16:13:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1392 states have (on average 1.2923850574712643) internal successors, (1799), 1400 states have internal predecessors, (1799), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2103 transitions. [2024-11-13 16:13:47,695 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2103 transitions. Word has length 122 [2024-11-13 16:13:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:47,698 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2103 transitions. [2024-11-13 16:13:47,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:13:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2103 transitions. [2024-11-13 16:13:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:13:47,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:47,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:47,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 16:13:47,701 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:47,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1313549394, now seen corresponding path program 1 times [2024-11-13 16:13:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:47,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782146617] [2024-11-13 16:13:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:48,441 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-13 16:13:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782146617] [2024-11-13 16:13:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782146617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 16:13:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524249084] [2024-11-13 16:13:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:48,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 16:13:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 16:13:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:13:48,444 INFO L87 Difference]: Start difference. First operand 1579 states and 2103 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-13 16:13:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:49,342 INFO L93 Difference]: Finished difference Result 3382 states and 4513 transitions. [2024-11-13 16:13:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:13:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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 122 [2024-11-13 16:13:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:49,355 INFO L225 Difference]: With dead ends: 3382 [2024-11-13 16:13:49,355 INFO L226 Difference]: Without dead ends: 1806 [2024-11-13 16:13:49,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-13 16:13:49,358 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 308 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:49,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 2860 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:13:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-13 16:13:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1567. [2024-11-13 16:13:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1380 states have (on average 1.2927536231884058) internal successors, (1784), 1388 states have internal predecessors, (1784), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2088 transitions. [2024-11-13 16:13:49,573 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2088 transitions. Word has length 122 [2024-11-13 16:13:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2088 transitions. [2024-11-13 16:13:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-13 16:13:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2088 transitions. [2024-11-13 16:13:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 16:13:49,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:49,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 16:13:49,576 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:49,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1088198513, now seen corresponding path program 1 times [2024-11-13 16:13:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233443981] [2024-11-13 16:13:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:50,363 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-13 16:13:50,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:50,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233443981] [2024-11-13 16:13:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233443981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:50,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:50,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 16:13:50,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578550938] [2024-11-13 16:13:50,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:50,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:13:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:50,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:13:50,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:13:50,365 INFO L87 Difference]: Start difference. First operand 1567 states and 2088 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 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-13 16:13:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:51,007 INFO L93 Difference]: Finished difference Result 2672 states and 3595 transitions. [2024-11-13 16:13:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:13:51,008 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 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 124 [2024-11-13 16:13:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:51,024 INFO L225 Difference]: With dead ends: 2672 [2024-11-13 16:13:51,027 INFO L226 Difference]: Without dead ends: 1640 [2024-11-13 16:13:51,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:13:51,030 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 50 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:51,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1964 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-13 16:13:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1594. [2024-11-13 16:13:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1407 states have (on average 1.287135749822317) internal successors, (1811), 1415 states have internal predecessors, (1811), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2115 transitions. [2024-11-13 16:13:51,300 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2115 transitions. Word has length 124 [2024-11-13 16:13:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:51,300 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 2115 transitions. [2024-11-13 16:13:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 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-13 16:13:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2115 transitions. [2024-11-13 16:13:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 16:13:51,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:51,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:51,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 16:13:51,304 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:51,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1488628392, now seen corresponding path program 1 times [2024-11-13 16:13:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431352537] [2024-11-13 16:13:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,727 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-13 16:13:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:51,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431352537] [2024-11-13 16:13:51,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431352537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:51,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039008828] [2024-11-13 16:13:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:51,732 INFO L87 Difference]: Start difference. First operand 1594 states and 2115 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 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-13 16:13:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:52,107 INFO L93 Difference]: Finished difference Result 2714 states and 3634 transitions. [2024-11-13 16:13:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 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 124 [2024-11-13 16:13:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:52,121 INFO L225 Difference]: With dead ends: 2714 [2024-11-13 16:13:52,121 INFO L226 Difference]: Without dead ends: 1625 [2024-11-13 16:13:52,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:52,124 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 53 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:52,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 845 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-13 16:13:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1559. [2024-11-13 16:13:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1372 states have (on average 1.2776967930029155) internal successors, (1753), 1380 states have internal predecessors, (1753), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2057 transitions. [2024-11-13 16:13:52,357 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2057 transitions. Word has length 124 [2024-11-13 16:13:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:52,357 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2057 transitions. [2024-11-13 16:13:52,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 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-13 16:13:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2057 transitions. [2024-11-13 16:13:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 16:13:52,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:52,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:52,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 16:13:52,359 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1436830296, now seen corresponding path program 1 times [2024-11-13 16:13:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963424060] [2024-11-13 16:13:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,526 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-13 16:13:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963424060] [2024-11-13 16:13:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963424060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:13:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748785747] [2024-11-13 16:13:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:13:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:13:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:13:52,529 INFO L87 Difference]: Start difference. First operand 1559 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-13 16:13:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:52,741 INFO L93 Difference]: Finished difference Result 3157 states and 4167 transitions. [2024-11-13 16:13:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:13:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 124 [2024-11-13 16:13:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:52,747 INFO L225 Difference]: With dead ends: 3157 [2024-11-13 16:13:52,748 INFO L226 Difference]: Without dead ends: 1601 [2024-11-13 16:13:52,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-13 16:13:52,751 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:52,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-11-13 16:13:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2024-11-13 16:13:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1414 states have (on average 1.2694483734087694) internal successors, (1795), 1422 states have internal predecessors, (1795), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2099 transitions. [2024-11-13 16:13:52,959 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2099 transitions. Word has length 124 [2024-11-13 16:13:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:52,959 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2099 transitions. [2024-11-13 16:13:52,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-13 16:13:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2099 transitions. [2024-11-13 16:13:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 16:13:52,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:52,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:52,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 16:13:52,961 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:52,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1484398419, now seen corresponding path program 1 times [2024-11-13 16:13:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934314981] [2024-11-13 16:13:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:52,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:53,369 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-13 16:13:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934314981] [2024-11-13 16:13:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934314981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014006823] [2024-11-13 16:13:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:53,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:53,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:53,372 INFO L87 Difference]: Start difference. First operand 1601 states and 2099 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-13 16:13:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:53,744 INFO L93 Difference]: Finished difference Result 3244 states and 4247 transitions. [2024-11-13 16:13:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 126 [2024-11-13 16:13:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:53,754 INFO L225 Difference]: With dead ends: 3244 [2024-11-13 16:13:53,754 INFO L226 Difference]: Without dead ends: 1646 [2024-11-13 16:13:53,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-13 16:13:53,757 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 84 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:53,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 582 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-11-13 16:13:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1584. [2024-11-13 16:13:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1397 states have (on average 1.2641374373657839) internal successors, (1766), 1405 states have internal predecessors, (1766), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:13:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2070 transitions. [2024-11-13 16:13:53,899 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2070 transitions. Word has length 126 [2024-11-13 16:13:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:53,899 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2070 transitions. [2024-11-13 16:13:53,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-13 16:13:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2070 transitions. [2024-11-13 16:13:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:13:53,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:53,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:53,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 16:13:53,900 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1303793736, now seen corresponding path program 1 times [2024-11-13 16:13:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415655] [2024-11-13 16:13:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:53,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,149 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-13 16:13:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415655] [2024-11-13 16:13:55,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:55,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:55,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 16:13:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010486159] [2024-11-13 16:13:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:13:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:55,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:13:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:13:55,152 INFO L87 Difference]: Start difference. First operand 1584 states and 2070 transitions. Second operand has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 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-13 16:13:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:56,187 INFO L93 Difference]: Finished difference Result 2811 states and 3701 transitions. [2024-11-13 16:13:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:13:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 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 128 [2024-11-13 16:13:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:56,194 INFO L225 Difference]: With dead ends: 2811 [2024-11-13 16:13:56,194 INFO L226 Difference]: Without dead ends: 1846 [2024-11-13 16:13:56,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:13:56,197 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 98 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:56,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2266 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:13:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-13 16:13:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1398. [2024-11-13 16:13:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1249 states have (on average 1.255404323458767) internal successors, (1568), 1254 states have internal predecessors, (1568), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 115 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-13 16:13:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1808 transitions. [2024-11-13 16:13:56,500 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1808 transitions. Word has length 128 [2024-11-13 16:13:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:56,501 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1808 transitions. [2024-11-13 16:13:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 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-13 16:13:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1808 transitions. [2024-11-13 16:13:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:13:56,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:56,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 16:13:56,503 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1983852106, now seen corresponding path program 1 times [2024-11-13 16:13:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:56,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500968189] [2024-11-13 16:13:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,792 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-13 16:13:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500968189] [2024-11-13 16:13:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500968189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849959506] [2024-11-13 16:13:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:56,794 INFO L87 Difference]: Start difference. First operand 1398 states and 1808 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-13 16:13:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:57,126 INFO L93 Difference]: Finished difference Result 2411 states and 3151 transitions. [2024-11-13 16:13:57,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 128 [2024-11-13 16:13:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:57,133 INFO L225 Difference]: With dead ends: 2411 [2024-11-13 16:13:57,133 INFO L226 Difference]: Without dead ends: 1628 [2024-11-13 16:13:57,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-13 16:13:57,135 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 92 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:57,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1052 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-13 16:13:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1388. [2024-11-13 16:13:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1239 states have (on average 1.2526230831315577) internal successors, (1552), 1244 states have internal predecessors, (1552), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 115 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-13 16:13:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1792 transitions. [2024-11-13 16:13:57,330 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1792 transitions. Word has length 128 [2024-11-13 16:13:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:57,331 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1792 transitions. [2024-11-13 16:13:57,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-13 16:13:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1792 transitions. [2024-11-13 16:13:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:13:57,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:57,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:57,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 16:13:57,333 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:57,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1231407178, now seen corresponding path program 1 times [2024-11-13 16:13:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864327476] [2024-11-13 16:13:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:13:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:13:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,610 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-13 16:13:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864327476] [2024-11-13 16:13:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864327476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:57,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:57,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:57,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437436649] [2024-11-13 16:13:57,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:57,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:57,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:57,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:57,612 INFO L87 Difference]: Start difference. First operand 1388 states and 1792 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-13 16:13:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:57,914 INFO L93 Difference]: Finished difference Result 2167 states and 2821 transitions. [2024-11-13 16:13:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 128 [2024-11-13 16:13:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:57,919 INFO L225 Difference]: With dead ends: 2167 [2024-11-13 16:13:57,919 INFO L226 Difference]: Without dead ends: 1505 [2024-11-13 16:13:57,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-13 16:13:57,921 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 92 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:57,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 803 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-11-13 16:13:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1056. [2024-11-13 16:13:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 955 states have (on average 1.242931937172775) internal successors, (1187), 956 states have internal predecessors, (1187), 80 states have call successors, (80), 20 states have call predecessors, (80), 20 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 16:13:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1347 transitions. [2024-11-13 16:13:58,049 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1347 transitions. Word has length 128 [2024-11-13 16:13:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:58,049 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1347 transitions. [2024-11-13 16:13:58,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-13 16:13:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1347 transitions. [2024-11-13 16:13:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:13:58,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:58,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 16:13:58,050 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1911465548, now seen corresponding path program 1 times [2024-11-13 16:13:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923642351] [2024-11-13 16:13:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:08,712 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:17,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int#3| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)) (.cse6 (select (select |c_#memory_int#5| |c_~#unsigned_long_int_Array_0~0.base|) 4))) (let ((.cse2 (mod (+ .cse6 632776602) 4294967296)) (.cse3 (mod (+ 632776476 .cse6 .cse7) 4294967296))) (let ((.cse4 (+ .cse2 .cse3)) (.cse5 (select (select |c_#memory_int#4| |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)) (.cse1 (mod (+ .cse6 2780260250) 4294967296))) (and (let ((.cse0 (mod (+ .cse6 .cse7 2780260378) 4294967296))) (or (< (+ .cse0 .cse1 1514706918) .cse2) (and (<= (+ .cse0 6442450690 (* 2 .cse1)) (+ (* .cse2 2) .cse3)) (= .cse4 (+ 7075227420 .cse5 .cse1))))) (= |c_~#unsigned_long_int_Array_0~0.offset| 0) (or (< (+ 632776476 .cse1 (mod (+ .cse6 .cse7 2147483648) 4294967296)) .cse2) (= .cse4 (+ 2780260124 .cse5 .cse1))))))) is different from false [2024-11-13 16:14:25,523 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:14:36,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#5| |c_~#unsigned_long_int_Array_0~0.base|) 4))) (let ((.cse3 (mod (+ .cse0 632776602) 4294967296)) (.cse1 (select (select |c_#memory_int#3| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse4 (+ .cse3 (mod (+ 632776476 .cse0 .cse1) 4294967296))) (.cse5 (select (select |c_#memory_int#4| |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (mod (+ .cse0 2780260250) 4294967296))) (and (= |c_~#unsigned_long_int_Array_0~0.offset| 0) (or (< (+ (mod (+ .cse0 .cse1 2780260378) 4294967296) .cse2 1514706918) .cse3) (= .cse4 (+ 7075227420 .cse5 .cse2))) (or (< (+ 632776476 .cse2 (mod (+ .cse0 .cse1 2147483648) 4294967296)) .cse3) (= .cse4 (+ 2780260124 .cse5 .cse2))))))) is different from false [2024-11-13 16:14:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:14:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:14:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:14:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:14:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:14:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:14:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:14:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:14:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:14:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:14:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:14:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:14:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-13 16:14:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:37,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923642351] [2024-11-13 16:14:37,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923642351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:14:37,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151080000] [2024-11-13 16:14:37,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:37,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:14:37,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:14:37,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:14:37,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:14:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:37,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 16:14:37,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:14:38,138 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-13 16:14:38,410 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 95 treesize of output 82 [2024-11-13 16:14:39,186 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 91 treesize of output 61 [2024-11-13 16:14:39,193 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 65 treesize of output 53 [2024-11-13 16:14:39,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:14:39,359 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 66 treesize of output 40 [2024-11-13 16:14:39,534 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-13 16:14:39,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:14:40,796 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 25 treesize of output 17 [2024-11-13 16:14:41,287 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-13 16:14:41,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151080000] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:14:41,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:14:41,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [28, 13] total 38 [2024-11-13 16:14:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406335907] [2024-11-13 16:14:41,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:41,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:14:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:14:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1157, Unknown=2, NotChecked=138, Total=1406 [2024-11-13 16:14:41,289 INFO L87 Difference]: Start difference. First operand 1056 states and 1347 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-13 16:14:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:42,512 INFO L93 Difference]: Finished difference Result 1590 states and 2036 transitions. [2024-11-13 16:14:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:14:42,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 128 [2024-11-13 16:14:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:42,516 INFO L225 Difference]: With dead ends: 1590 [2024-11-13 16:14:42,516 INFO L226 Difference]: Without dead ends: 1192 [2024-11-13 16:14:42,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=137, Invalid=1591, Unknown=2, NotChecked=162, Total=1892 [2024-11-13 16:14:42,517 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 92 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:42,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1889 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:14:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-13 16:14:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1052. [2024-11-13 16:14:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 951 states have (on average 1.2439537329127235) internal successors, (1183), 952 states have internal predecessors, (1183), 80 states have call successors, (80), 20 states have call predecessors, (80), 20 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 16:14:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1343 transitions. [2024-11-13 16:14:42,671 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1343 transitions. Word has length 128 [2024-11-13 16:14:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:42,671 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1343 transitions. [2024-11-13 16:14:42,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-13 16:14:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1343 transitions. [2024-11-13 16:14:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:14:42,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:42,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:14:42,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:14:42,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 16:14:42,874 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:42,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1278021759, now seen corresponding path program 1 times [2024-11-13 16:14:42,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939951022] [2024-11-13 16:14:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:14:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:14:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:14:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:14:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:14:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:14:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:14:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:14:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:14:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:14:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:14:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:14:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 16:14:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939951022] [2024-11-13 16:14:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939951022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:44,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:14:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761897755] [2024-11-13 16:14:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:14:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:14:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:14:44,317 INFO L87 Difference]: Start difference. First operand 1052 states and 1343 transitions. Second operand has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:14:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:45,156 INFO L93 Difference]: Finished difference Result 2064 states and 2636 transitions. [2024-11-13 16:14:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:14:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2024-11-13 16:14:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:45,160 INFO L225 Difference]: With dead ends: 2064 [2024-11-13 16:14:45,160 INFO L226 Difference]: Without dead ends: 1015 [2024-11-13 16:14:45,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:14:45,162 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 290 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:45,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 853 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:14:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-13 16:14:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 983. [2024-11-13 16:14:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 882 states have (on average 1.2505668934240364) internal successors, (1103), 883 states have internal predecessors, (1103), 80 states have call successors, (80), 20 states have call predecessors, (80), 20 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 16:14:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1263 transitions. [2024-11-13 16:14:45,289 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1263 transitions. Word has length 128 [2024-11-13 16:14:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1263 transitions. [2024-11-13 16:14:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:14:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1263 transitions. [2024-11-13 16:14:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:14:45,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:45,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:14:45,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 16:14:45,291 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2088129157, now seen corresponding path program 1 times [2024-11-13 16:14:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503462941] [2024-11-13 16:14:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:14:45,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:14:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:14:45,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:14:45,469 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:14:45,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:14:45,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 16:14:45,477 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:14:45,600 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:14:45,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:14:45 BoogieIcfgContainer [2024-11-13 16:14:45,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:14:45,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:14:45,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:14:45,604 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:14:45,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:05" (3/4) ... [2024-11-13 16:14:45,607 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:14:45,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:14:45,608 INFO L158 Benchmark]: Toolchain (without parser) took 101053.43ms. Allocated memory was 117.4MB in the beginning and 721.4MB in the end (delta: 604.0MB). Free memory was 91.9MB in the beginning and 550.4MB in the end (delta: -458.5MB). Peak memory consumption was 145.2MB. Max. memory is 16.1GB. [2024-11-13 16:14:45,608 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 85.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:14:45,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.06ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:14:45,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.68ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:14:45,609 INFO L158 Benchmark]: Boogie Preprocessor took 114.57ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 69.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:14:45,609 INFO L158 Benchmark]: RCFGBuilder took 940.99ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 38.7MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:14:45,609 INFO L158 Benchmark]: TraceAbstraction took 99604.96ms. Allocated memory was 117.4MB in the beginning and 721.4MB in the end (delta: 604.0MB). Free memory was 38.3MB in the beginning and 550.5MB in the end (delta: -512.2MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2024-11-13 16:14:45,609 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 721.4MB. Free memory was 550.5MB in the beginning and 550.4MB in the end (delta: 65.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:14:45,611 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.30ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 85.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.06ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.68ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 114.57ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 69.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 940.99ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 38.7MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 99604.96ms. Allocated memory was 117.4MB in the beginning and 721.4MB in the end (delta: 604.0MB). Free memory was 38.3MB in the beginning and 550.5MB in the end (delta: -512.2MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 721.4MB. Free memory was 550.5MB in the beginning and 550.4MB in the end (delta: 65.4kB). 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 someBinaryArithmeticDOUBLEoperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -10; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] double_Array_0[3] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] double_Array_0[4] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L41] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L44] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] unsigned_long_int_Array_0[1] = ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))) [L46] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L50] EXPR signed_long_int_Array_0[0] [L50] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR signed_long_int_Array_0[0] [L51] EXPR signed_long_int_Array_0[0] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}] [L51] COND TRUE stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L52] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[1]) [L57] signed_char_Array_0[1] = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] EXPR signed_char_Array_0[1] [L62] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] COND TRUE signed_char_Array_0[1] >= signed_char_Array_0[1] [L63] EXPR double_Array_0[0] [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] double_Array_0[2] = (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR BOOL_unsigned_char_Array_0[1] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) [L94] EXPR signed_char_Array_0[1] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) [L94] EXPR unsigned_long_int_Array_0[1] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) [L94] EXPR signed_char_Array_0[1] [L94] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) [L94] EXPR double_Array_0[2] [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 99.4s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6915 SdHoareTripleChecker+Valid, 15.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6894 mSDsluCounter, 44578 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37358 mSDsCounter, 928 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11459 IncrementalHoareTripleChecker+Invalid, 12387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 928 mSolverCounterUnsat, 7220 mSDtfsCounter, 11459 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1621 GetRequests, 1227 SyntacticMatches, 1 SemanticMatches, 393 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1762occurred in iteration=24, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 5515 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 64.8s InterpolantComputationTime, 4488 NumberOfCodeBlocks, 4488 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4451 ConstructedInterpolants, 0 QuantifiedInterpolants, 32267 SizeOfPredicates, 14 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 37 InterpolantComputations, 35 PerfectInterpolantSequences, 9732/9768 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-13 16:14:45,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd --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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:14:48,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:14:48,334 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:14:48,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:14:48,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:14:48,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:14:48,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:14:48,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:14:48,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:14:48,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:14:48,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:14:48,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:14:48,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:14:48,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:14:48,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:14:48,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:14:48,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:14:48,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:14:48,408 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:14:48,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:14:48,409 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:14:48,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:14:48,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:14:48,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:14:48,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:14:48,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:14:48,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:14:48,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:14:48,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:14:48,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:14:48,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:14:48,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:14:48,410 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:14:48,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:14:48,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:14:48,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:14:48,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:14:48,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:14:48,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd 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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2024-11-13 16:14:48,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:14:48,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:14:48,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:14:48,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:14:48,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:14:48,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i Unable to find full path for "g++" [2024-11-13 16:14:50,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:14:50,972 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:14:50,972 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2024-11-13 16:14:50,986 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data/3465bf730/fbd4b33aa6364754bf58b996d7531a5f/FLAG03503ebfb [2024-11-13 16:14:51,010 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/data/3465bf730/fbd4b33aa6364754bf58b996d7531a5f [2024-11-13 16:14:51,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:14:51,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:14:51,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:14:51,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:14:51,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:14:51,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c52ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51, skipping insertion in model container [2024-11-13 16:14:51,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:14:51,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2024-11-13 16:14:51,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:14:51,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:14:51,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2024-11-13 16:14:51,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:14:51,457 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:14:51,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51 WrapperNode [2024-11-13 16:14:51,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:14:51,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:14:51,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:14:51,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:14:51,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,535 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-13 16:14:51,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:14:51,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:14:51,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:14:51,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:14:51,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,602 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-13 16:14:51,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:14:51,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:14:51,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:14:51,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:14:51,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (1/1) ... [2024-11-13 16:14:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:14:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:14:51,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:14:51,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:14:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:14:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 16:14:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 16:14:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 16:14:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 16:14:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 16:14:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 16:14:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 16:14:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 16:14:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 16:14:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 16:14:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:14:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:14:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 16:14:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 16:14:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 16:14:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 16:14:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 16:14:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 16:14:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 16:14:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 16:14:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 16:14:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 16:14:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 16:14:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 16:14:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 16:14:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 16:14:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 16:14:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 16:14:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 16:14:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 16:14:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:14:51,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:14:51,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 16:14:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 16:14:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 16:14:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 16:14:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 16:14:52,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:14:52,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:14:54,552 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-13 16:14:54,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:14:54,564 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:14:54,565 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:14:54,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:14:54 BoogieIcfgContainer [2024-11-13 16:14:54,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:14:54,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:14:54,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:14:54,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:14:54,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:14:51" (1/3) ... [2024-11-13 16:14:54,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f60c77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:14:54, skipping insertion in model container [2024-11-13 16:14:54,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:14:51" (2/3) ... [2024-11-13 16:14:54,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f60c77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:14:54, skipping insertion in model container [2024-11-13 16:14:54,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:14:54" (3/3) ... [2024-11-13 16:14:54,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2024-11-13 16:14:54,590 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:14:54,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-15.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:14:54,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:14:54,687 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;@534ea9cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:14:54,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:14:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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-13 16:14:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:14:54,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:54,724 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, 1, 1, 1, 1, 1] [2024-11-13 16:14:54,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 357738169, now seen corresponding path program 1 times [2024-11-13 16:14:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:14:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751257003] [2024-11-13 16:14:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:54,747 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-13 16:14:54,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:14:54,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:54,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:55,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 16:14:55,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:14:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 16:14:55,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:14:55,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:14:55,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751257003] [2024-11-13 16:14:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751257003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:55,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:55,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:14:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346500291] [2024-11-13 16:14:55,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:55,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:14:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:14:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:14:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:14:55,323 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-13 16:14:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:55,359 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-13 16:14:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:14:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 115 [2024-11-13 16:14:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:55,370 INFO L225 Difference]: With dead ends: 219 [2024-11-13 16:14:55,371 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 16:14:55,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-13 16:14:55,379 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:55,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:14:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 16:14:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 16:14:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 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-13 16:14:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 16:14:55,428 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 16:14:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:55,428 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 16:14:55,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-13 16:14:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 16:14:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:14:55,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:55,432 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, 1, 1, 1, 1, 1] [2024-11-13 16:14:55,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 16:14:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:55,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:55,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1502558233, now seen corresponding path program 1 times [2024-11-13 16:14:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:14:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79034293] [2024-11-13 16:14:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:55,639 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-13 16:14:55,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:14:55,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:55,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:56,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:14:56,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:14:56,793 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 33 treesize of output 15 [2024-11-13 16:14:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:14:56,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:14:57,143 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-13 16:14:57,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:14:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79034293] [2024-11-13 16:14:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79034293] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:14:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:14:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-13 16:14:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307679749] [2024-11-13 16:14:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:14:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:14:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:14:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:14:57,147 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-13 16:14:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:57,365 INFO L93 Difference]: Finished difference Result 275 states and 395 transitions. [2024-11-13 16:14:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:14:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 115 [2024-11-13 16:14:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:57,369 INFO L225 Difference]: With dead ends: 275 [2024-11-13 16:14:57,372 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 16:14:57,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:14:57,373 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 83 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:57,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 695 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:14:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 16:14:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-13 16:14:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 150 states have internal predecessors, (210), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:14:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2024-11-13 16:14:57,404 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 115 [2024-11-13 16:14:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:57,405 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2024-11-13 16:14:57,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-13 16:14:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2024-11-13 16:14:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:14:57,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:57,412 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, 1, 1, 1, 1, 1] [2024-11-13 16:14:57,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 16:14:57,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:57,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:57,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1007688176, now seen corresponding path program 1 times [2024-11-13 16:14:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:14:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449711615] [2024-11-13 16:14:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:57,614 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-13 16:14:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:14:57,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:57,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:14:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:57,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:14:58,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:14:58,674 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 15 treesize of output 7 [2024-11-13 16:14:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 16:14:58,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:14:58,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:14:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449711615] [2024-11-13 16:14:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449711615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:58,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:14:58,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038908770] [2024-11-13 16:14:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:58,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:14:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:14:58,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:14:58,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:14:58,726 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (12), 1 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-13 16:14:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:59,980 INFO L93 Difference]: Finished difference Result 548 states and 784 transitions. [2024-11-13 16:14:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:14:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (12), 1 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 115 [2024-11-13 16:14:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:59,985 INFO L225 Difference]: With dead ends: 548 [2024-11-13 16:14:59,985 INFO L226 Difference]: Without dead ends: 385 [2024-11-13 16:14:59,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:14:59,987 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 327 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:59,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 962 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:14:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-13 16:15:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 279. [2024-11-13 16:15:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 245 states have (on average 1.3959183673469389) internal successors, (342), 247 states have internal predecessors, (342), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:15:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 398 transitions. [2024-11-13 16:15:00,037 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 398 transitions. Word has length 115 [2024-11-13 16:15:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 398 transitions. [2024-11-13 16:15:00,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (12), 1 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-13 16:15:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 398 transitions. [2024-11-13 16:15:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:15:00,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:00,040 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, 1, 1, 1, 1, 1] [2024-11-13 16:15:00,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:00,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:00,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash -873674670, now seen corresponding path program 1 times [2024-11-13 16:15:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43011842] [2024-11-13 16:15:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:00,246 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-13 16:15:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:00,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:00,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:00,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:15:00,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:15:01,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:01,349 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-13 16:15:01,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43011842] [2024-11-13 16:15:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43011842] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:01,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:01,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 16:15:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014464788] [2024-11-13 16:15:01,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:01,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:15:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:01,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:15:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:15:01,355 INFO L87 Difference]: Start difference. First operand 279 states and 398 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-13 16:15:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:01,560 INFO L93 Difference]: Finished difference Result 558 states and 792 transitions. [2024-11-13 16:15:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:01,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 115 [2024-11-13 16:15:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:01,566 INFO L225 Difference]: With dead ends: 558 [2024-11-13 16:15:01,566 INFO L226 Difference]: Without dead ends: 291 [2024-11-13 16:15:01,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:01,569 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 156 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:01,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 454 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:15:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-13 16:15:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 227. [2024-11-13 16:15:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.3756345177664975) internal successors, (271), 197 states have internal predecessors, (271), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 16:15:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-11-13 16:15:01,623 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 115 [2024-11-13 16:15:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:01,623 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-11-13 16:15:01,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-13 16:15:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-11-13 16:15:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:15:01,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:01,628 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, 1, 1, 1, 1, 1] [2024-11-13 16:15:01,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:01,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:01,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:01,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1732348884, now seen corresponding path program 1 times [2024-11-13 16:15:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56325769] [2024-11-13 16:15:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:01,834 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-13 16:15:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:01,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:01,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:02,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:15:02,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:02,683 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-13 16:15:02,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:02,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56325769] [2024-11-13 16:15:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56325769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:15:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147306204] [2024-11-13 16:15:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:15:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:15:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:15:02,687 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:15:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:02,811 INFO L93 Difference]: Finished difference Result 462 states and 648 transitions. [2024-11-13 16:15:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2024-11-13 16:15:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:02,813 INFO L225 Difference]: With dead ends: 462 [2024-11-13 16:15:02,814 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 16:15:02,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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-13 16:15:02,816 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 90 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:02,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 440 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:15:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 16:15:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2024-11-13 16:15:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3686868686868687) internal successors, (271), 198 states have internal predecessors, (271), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 16:15:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 319 transitions. [2024-11-13 16:15:02,845 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 319 transitions. Word has length 115 [2024-11-13 16:15:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:02,846 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 319 transitions. [2024-11-13 16:15:02,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-13 16:15:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 319 transitions. [2024-11-13 16:15:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:15:02,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:02,848 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, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:02,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 16:15:03,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:03,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:03,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash -262343157, now seen corresponding path program 1 times [2024-11-13 16:15:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341064332] [2024-11-13 16:15:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:03,056 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-13 16:15:03,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:03,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:03,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:03,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:15:03,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:03,455 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-13 16:15:03,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:15:03,508 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-13 16:15:03,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:03,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341064332] [2024-11-13 16:15:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341064332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:15:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075891290] [2024-11-13 16:15:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:03,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:15:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:15:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:15:03,510 INFO L87 Difference]: Start difference. First operand 228 states and 319 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-13 16:15:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:03,759 INFO L93 Difference]: Finished difference Result 674 states and 945 transitions. [2024-11-13 16:15:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:15:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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 116 [2024-11-13 16:15:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:03,764 INFO L225 Difference]: With dead ends: 674 [2024-11-13 16:15:03,764 INFO L226 Difference]: Without dead ends: 449 [2024-11-13 16:15:03,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-13 16:15:03,766 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 146 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:03,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 608 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:15:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-13 16:15:03,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-11-13 16:15:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 388 states have (on average 1.365979381443299) internal successors, (530), 388 states have internal predecessors, (530), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 626 transitions. [2024-11-13 16:15:03,813 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 626 transitions. Word has length 116 [2024-11-13 16:15:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:03,815 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 626 transitions. [2024-11-13 16:15:03,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-13 16:15:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 626 transitions. [2024-11-13 16:15:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:15:03,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:03,817 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, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:03,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 16:15:04,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:04,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -390506924, now seen corresponding path program 1 times [2024-11-13 16:15:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138482928] [2024-11-13 16:15:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:04,022 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-13 16:15:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:04,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:04,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:04,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:15:04,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:15:05,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:05,282 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-13 16:15:05,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138482928] [2024-11-13 16:15:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138482928] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:05,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:05,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 16:15:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341640628] [2024-11-13 16:15:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:05,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:15:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:15:05,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:15:05,286 INFO L87 Difference]: Start difference. First operand 447 states and 626 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (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-13 16:15:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:05,518 INFO L93 Difference]: Finished difference Result 1005 states and 1405 transitions. [2024-11-13 16:15:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (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 116 [2024-11-13 16:15:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:05,523 INFO L225 Difference]: With dead ends: 1005 [2024-11-13 16:15:05,525 INFO L226 Difference]: Without dead ends: 561 [2024-11-13 16:15:05,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:05,527 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 71 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:05,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 601 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:15:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-13 16:15:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 467. [2024-11-13 16:15:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 408 states have (on average 1.3676470588235294) internal successors, (558), 408 states have internal predecessors, (558), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2024-11-13 16:15:05,562 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 116 [2024-11-13 16:15:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:05,563 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2024-11-13 16:15:05,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (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-13 16:15:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2024-11-13 16:15:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:15:05,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:05,566 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, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:05,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:05,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:05,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:05,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -132341486, now seen corresponding path program 1 times [2024-11-13 16:15:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383710317] [2024-11-13 16:15:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:05,768 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-13 16:15:05,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:05,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:05,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:06,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:15:06,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:06,809 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-13 16:15:06,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:06,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:06,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383710317] [2024-11-13 16:15:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383710317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:06,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:15:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037179014] [2024-11-13 16:15:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:15:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:15:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:15:06,811 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-13 16:15:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:06,937 INFO L93 Difference]: Finished difference Result 951 states and 1330 transitions. [2024-11-13 16:15:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:06,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 116 [2024-11-13 16:15:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:06,941 INFO L225 Difference]: With dead ends: 951 [2024-11-13 16:15:06,941 INFO L226 Difference]: Without dead ends: 487 [2024-11-13 16:15:06,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-13 16:15:06,943 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 80 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:06,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 524 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:15:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-13 16:15:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 469. [2024-11-13 16:15:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 410 states have (on average 1.3609756097560977) internal successors, (558), 410 states have internal predecessors, (558), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 654 transitions. [2024-11-13 16:15:06,985 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 654 transitions. Word has length 116 [2024-11-13 16:15:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:06,986 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 654 transitions. [2024-11-13 16:15:06,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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-13 16:15:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 654 transitions. [2024-11-13 16:15:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:15:06,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:06,988 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:07,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:07,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:07,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:07,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash -39686846, now seen corresponding path program 1 times [2024-11-13 16:15:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:07,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320439545] [2024-11-13 16:15:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:07,190 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-13 16:15:07,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:07,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:07,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:07,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:15:07,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:15:08,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:08,298 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-13 16:15:08,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320439545] [2024-11-13 16:15:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320439545] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-13 16:15:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372892787] [2024-11-13 16:15:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:08,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:15:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:15:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:08,301 INFO L87 Difference]: Start difference. First operand 469 states and 654 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 16:15:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:08,521 INFO L93 Difference]: Finished difference Result 813 states and 1131 transitions. [2024-11-13 16:15:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 117 [2024-11-13 16:15:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:08,527 INFO L225 Difference]: With dead ends: 813 [2024-11-13 16:15:08,527 INFO L226 Difference]: Without dead ends: 561 [2024-11-13 16:15:08,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:15:08,528 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:08,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 678 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:15:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-13 16:15:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 467. [2024-11-13 16:15:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 408 states have (on average 1.3529411764705883) internal successors, (552), 408 states have internal predecessors, (552), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 648 transitions. [2024-11-13 16:15:08,587 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 648 transitions. Word has length 117 [2024-11-13 16:15:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:08,587 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 648 transitions. [2024-11-13 16:15:08,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 16:15:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 648 transitions. [2024-11-13 16:15:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:15:08,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:08,590 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:08,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:08,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1272971539, now seen corresponding path program 1 times [2024-11-13 16:15:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:08,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387916275] [2024-11-13 16:15:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:08,792 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-13 16:15:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:08,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:08,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:09,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:09,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:15:09,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:09,733 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-13 16:15:09,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387916275] [2024-11-13 16:15:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387916275] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 16:15:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163086914] [2024-11-13 16:15:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:15:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:15:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:15:09,735 INFO L87 Difference]: Start difference. First operand 467 states and 648 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 16:15:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:09,944 INFO L93 Difference]: Finished difference Result 807 states and 1117 transitions. [2024-11-13 16:15:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:09,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 117 [2024-11-13 16:15:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:09,948 INFO L225 Difference]: With dead ends: 807 [2024-11-13 16:15:09,948 INFO L226 Difference]: Without dead ends: 557 [2024-11-13 16:15:09,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:09,949 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 77 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:09,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 659 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:15:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-13 16:15:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 463. [2024-11-13 16:15:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 404 states have (on average 1.3415841584158417) internal successors, (542), 404 states have internal predecessors, (542), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 638 transitions. [2024-11-13 16:15:09,980 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 638 transitions. Word has length 117 [2024-11-13 16:15:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 638 transitions. [2024-11-13 16:15:09,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 16:15:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 638 transitions. [2024-11-13 16:15:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:15:09,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:09,982 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:09,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:10,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:10,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2121387100, now seen corresponding path program 1 times [2024-11-13 16:15:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130890854] [2024-11-13 16:15:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:10,185 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-13 16:15:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:10,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:10,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:10,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:15:10,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:15:11,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:11,651 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-13 16:15:11,651 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130890854] [2024-11-13 16:15:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130890854] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-13 16:15:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092720318] [2024-11-13 16:15:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:11,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:15:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:15:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:11,653 INFO L87 Difference]: Start difference. First operand 463 states and 638 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (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-13 16:15:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:11,932 INFO L93 Difference]: Finished difference Result 801 states and 1101 transitions. [2024-11-13 16:15:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (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 118 [2024-11-13 16:15:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:11,937 INFO L225 Difference]: With dead ends: 801 [2024-11-13 16:15:11,937 INFO L226 Difference]: Without dead ends: 555 [2024-11-13 16:15:11,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:15:11,939 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 131 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:11,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 532 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:15:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-13 16:15:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 463. [2024-11-13 16:15:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 404 states have (on average 1.3366336633663367) internal successors, (540), 404 states have internal predecessors, (540), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 636 transitions. [2024-11-13 16:15:11,981 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 636 transitions. Word has length 118 [2024-11-13 16:15:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:11,981 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 636 transitions. [2024-11-13 16:15:11,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (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-13 16:15:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 636 transitions. [2024-11-13 16:15:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:15:11,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:11,983 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:11,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:12,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:12,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2046985604, now seen corresponding path program 1 times [2024-11-13 16:15:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836702795] [2024-11-13 16:15:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:12,185 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-13 16:15:12,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:12,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:12,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:12,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 16:15:12,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:12,756 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-13 16:15:12,822 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 43 treesize of output 25 [2024-11-13 16:15:12,865 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-13 16:15:12,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:12,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836702795] [2024-11-13 16:15:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836702795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:12,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:15:12,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580113149] [2024-11-13 16:15:12,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:12,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:12,867 INFO L87 Difference]: Start difference. First operand 463 states and 636 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (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-13 16:15:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:13,238 INFO L93 Difference]: Finished difference Result 931 states and 1278 transitions. [2024-11-13 16:15:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:15:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (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 118 [2024-11-13 16:15:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:13,242 INFO L225 Difference]: With dead ends: 931 [2024-11-13 16:15:13,242 INFO L226 Difference]: Without dead ends: 471 [2024-11-13 16:15:13,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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-13 16:15:13,245 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 142 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:13,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1170 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:15:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-13 16:15:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2024-11-13 16:15:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 410 states have internal predecessors, (546), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 642 transitions. [2024-11-13 16:15:13,275 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 642 transitions. Word has length 118 [2024-11-13 16:15:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:13,276 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 642 transitions. [2024-11-13 16:15:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (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-13 16:15:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 642 transitions. [2024-11-13 16:15:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:15:13,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:13,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:13,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:13,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:13,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash 972487439, now seen corresponding path program 1 times [2024-11-13 16:15:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352150118] [2024-11-13 16:15:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:13,480 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-13 16:15:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:13,481 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:13,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:13,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:13,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:14,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 16:15:14,844 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-13 16:15:14,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:14,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352150118] [2024-11-13 16:15:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352150118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:15:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464360199] [2024-11-13 16:15:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:14,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:15:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:15:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:15:14,846 INFO L87 Difference]: Start difference. First operand 469 states and 642 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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-13 16:15:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:15,655 INFO L93 Difference]: Finished difference Result 908 states and 1237 transitions. [2024-11-13 16:15:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:15:15,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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 119 [2024-11-13 16:15:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:15,658 INFO L225 Difference]: With dead ends: 908 [2024-11-13 16:15:15,658 INFO L226 Difference]: Without dead ends: 442 [2024-11-13 16:15:15,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:15:15,659 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 281 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:15,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 940 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:15:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-13 16:15:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 420. [2024-11-13 16:15:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 361 states have (on average 1.3213296398891967) internal successors, (477), 361 states have internal predecessors, (477), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 573 transitions. [2024-11-13 16:15:15,694 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 573 transitions. Word has length 119 [2024-11-13 16:15:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:15,694 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 573 transitions. [2024-11-13 16:15:15,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 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-13 16:15:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 573 transitions. [2024-11-13 16:15:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:15:15,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:15,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:15,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-13 16:15:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:15,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1914050519, now seen corresponding path program 1 times [2024-11-13 16:15:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603572626] [2024-11-13 16:15:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:15,898 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-13 16:15:15,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:15,899 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:15,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-13 16:15:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:16,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:16,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:17,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 16:15:17,288 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-13 16:15:17,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:17,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603572626] [2024-11-13 16:15:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603572626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:15:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528238607] [2024-11-13 16:15:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:15:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:15:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:15:17,290 INFO L87 Difference]: Start difference. First operand 420 states and 573 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 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-13 16:15:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:17,987 INFO L93 Difference]: Finished difference Result 788 states and 1071 transitions. [2024-11-13 16:15:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:15:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 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 120 [2024-11-13 16:15:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:17,991 INFO L225 Difference]: With dead ends: 788 [2024-11-13 16:15:17,991 INFO L226 Difference]: Without dead ends: 431 [2024-11-13 16:15:17,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:17,995 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 177 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:17,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 994 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:15:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-13 16:15:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 415. [2024-11-13 16:15:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 356 states have (on average 1.3174157303370786) internal successors, (469), 356 states have internal predecessors, (469), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:15:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 565 transitions. [2024-11-13 16:15:18,026 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 565 transitions. Word has length 120 [2024-11-13 16:15:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:18,027 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 565 transitions. [2024-11-13 16:15:18,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 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-13 16:15:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 565 transitions. [2024-11-13 16:15:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:15:18,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:18,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:18,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-13 16:15:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:18,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash -305466369, now seen corresponding path program 1 times [2024-11-13 16:15:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088158344] [2024-11-13 16:15:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:18,230 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-13 16:15:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:18,234 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:18,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-13 16:15:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:18,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:18,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:18,683 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 29 treesize of output 24 [2024-11-13 16:15:18,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:18,734 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 45 treesize of output 19 [2024-11-13 16:15:18,786 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-13 16:15:18,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:18,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088158344] [2024-11-13 16:15:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088158344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:15:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145185647] [2024-11-13 16:15:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:18,791 INFO L87 Difference]: Start difference. First operand 415 states and 565 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-13 16:15:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:19,280 INFO L93 Difference]: Finished difference Result 934 states and 1280 transitions. [2024-11-13 16:15:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:15:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 121 [2024-11-13 16:15:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:19,284 INFO L225 Difference]: With dead ends: 934 [2024-11-13 16:15:19,284 INFO L226 Difference]: Without dead ends: 685 [2024-11-13 16:15:19,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 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-13 16:15:19,285 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 301 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:19,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 945 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:15:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-13 16:15:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 598. [2024-11-13 16:15:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 519 states have (on average 1.329479768786127) internal successors, (690), 521 states have internal predecessors, (690), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 818 transitions. [2024-11-13 16:15:19,322 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 818 transitions. Word has length 121 [2024-11-13 16:15:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:19,323 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 818 transitions. [2024-11-13 16:15:19,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-13 16:15:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 818 transitions. [2024-11-13 16:15:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:15:19,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:19,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:19,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-13 16:15:19,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:19,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:19,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1083205128, now seen corresponding path program 1 times [2024-11-13 16:15:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:19,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353740755] [2024-11-13 16:15:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:19,527 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-13 16:15:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:19,529 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:19,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-13 16:15:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:20,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:20,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:20,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:20,265 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 155 treesize of output 65 [2024-11-13 16:15:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 16:15:20,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:20,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353740755] [2024-11-13 16:15:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353740755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:20,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:15:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318136400] [2024-11-13 16:15:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:20,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:20,304 INFO L87 Difference]: Start difference. First operand 598 states and 818 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-13 16:15:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:23,083 INFO L93 Difference]: Finished difference Result 1180 states and 1614 transitions. [2024-11-13 16:15:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:15:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 121 [2024-11-13 16:15:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:23,092 INFO L225 Difference]: With dead ends: 1180 [2024-11-13 16:15:23,093 INFO L226 Difference]: Without dead ends: 604 [2024-11-13 16:15:23,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:15:23,095 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 136 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:23,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 487 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 16:15:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-13 16:15:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2024-11-13 16:15:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 519 states have (on average 1.3179190751445087) internal successors, (684), 521 states have internal predecessors, (684), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 812 transitions. [2024-11-13 16:15:23,134 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 812 transitions. Word has length 121 [2024-11-13 16:15:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:23,135 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 812 transitions. [2024-11-13 16:15:23,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-13 16:15:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 812 transitions. [2024-11-13 16:15:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 16:15:23,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:23,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:23,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-13 16:15:23,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:23,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:23,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1514584094, now seen corresponding path program 1 times [2024-11-13 16:15:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331267802] [2024-11-13 16:15:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:23,339 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-13 16:15:23,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:23,341 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:23,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-13 16:15:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:23,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:23,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:24,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:24,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-13 16:15:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 16:15:24,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:24,107 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331267802] [2024-11-13 16:15:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331267802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:15:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472254651] [2024-11-13 16:15:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:24,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:24,109 INFO L87 Difference]: Start difference. First operand 598 states and 812 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-13 16:15:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:26,826 INFO L93 Difference]: Finished difference Result 1173 states and 1592 transitions. [2024-11-13 16:15:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:15:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 123 [2024-11-13 16:15:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:26,836 INFO L225 Difference]: With dead ends: 1173 [2024-11-13 16:15:26,836 INFO L226 Difference]: Without dead ends: 604 [2024-11-13 16:15:26,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:15:26,838 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 128 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:26,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 16:15:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-13 16:15:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2024-11-13 16:15:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 519 states have (on average 1.30635838150289) internal successors, (678), 521 states have internal predecessors, (678), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 806 transitions. [2024-11-13 16:15:26,875 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 806 transitions. Word has length 123 [2024-11-13 16:15:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:26,876 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 806 transitions. [2024-11-13 16:15:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-13 16:15:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 806 transitions. [2024-11-13 16:15:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 16:15:26,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:26,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:26,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-13 16:15:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:27,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash -63054520, now seen corresponding path program 1 times [2024-11-13 16:15:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279620890] [2024-11-13 16:15:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:27,079 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-13 16:15:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:27,081 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:27,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-13 16:15:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:27,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:27,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:27,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:27,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-13 16:15:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 16:15:27,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:27,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279620890] [2024-11-13 16:15:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279620890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:15:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405407727] [2024-11-13 16:15:27,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:27,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:27,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:27,920 INFO L87 Difference]: Start difference. First operand 598 states and 806 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-13 16:15:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:30,253 INFO L93 Difference]: Finished difference Result 1166 states and 1570 transitions. [2024-11-13 16:15:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:15:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 125 [2024-11-13 16:15:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:30,260 INFO L225 Difference]: With dead ends: 1166 [2024-11-13 16:15:30,260 INFO L226 Difference]: Without dead ends: 604 [2024-11-13 16:15:30,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:15:30,261 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 118 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:30,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 479 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 16:15:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-13 16:15:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2024-11-13 16:15:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 519 states have (on average 1.2947976878612717) internal successors, (672), 521 states have internal predecessors, (672), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 800 transitions. [2024-11-13 16:15:30,299 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 800 transitions. Word has length 125 [2024-11-13 16:15:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:30,299 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 800 transitions. [2024-11-13 16:15:30,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-13 16:15:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 800 transitions. [2024-11-13 16:15:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 16:15:30,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:30,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:30,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-13 16:15:30,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:30,502 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1650312482, now seen corresponding path program 1 times [2024-11-13 16:15:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945530473] [2024-11-13 16:15:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:30,503 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-13 16:15:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:30,506 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:30,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-13 16:15:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:31,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:31,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:31,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:31,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-13 16:15:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 16:15:31,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:31,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945530473] [2024-11-13 16:15:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945530473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:15:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518241529] [2024-11-13 16:15:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:31,486 INFO L87 Difference]: Start difference. First operand 598 states and 800 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-13 16:15:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:34,317 INFO L93 Difference]: Finished difference Result 1159 states and 1548 transitions. [2024-11-13 16:15:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:15:34,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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 127 [2024-11-13 16:15:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:34,335 INFO L225 Difference]: With dead ends: 1159 [2024-11-13 16:15:34,335 INFO L226 Difference]: Without dead ends: 604 [2024-11-13 16:15:34,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:15:34,336 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 110 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:34,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 472 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 16:15:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-13 16:15:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2024-11-13 16:15:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 519 states have (on average 1.283236994219653) internal successors, (666), 521 states have internal predecessors, (666), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 794 transitions. [2024-11-13 16:15:34,372 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 794 transitions. Word has length 127 [2024-11-13 16:15:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:34,372 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 794 transitions. [2024-11-13 16:15:34,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-13 16:15:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 794 transitions. [2024-11-13 16:15:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 16:15:34,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:34,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:34,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-13 16:15:34,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:34,574 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:34,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 43879494, now seen corresponding path program 1 times [2024-11-13 16:15:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867495704] [2024-11-13 16:15:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:34,575 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-13 16:15:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:34,577 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:34,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-13 16:15:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:35,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:15:35,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-13 16:15:35,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:35,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:35,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867495704] [2024-11-13 16:15:35,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867495704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:35,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:35,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:15:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121452770] [2024-11-13 16:15:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:35,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:35,126 INFO L87 Difference]: Start difference. First operand 598 states and 794 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:15:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:35,341 INFO L93 Difference]: Finished difference Result 1188 states and 1571 transitions. [2024-11-13 16:15:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:15:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2024-11-13 16:15:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:35,344 INFO L225 Difference]: With dead ends: 1188 [2024-11-13 16:15:35,344 INFO L226 Difference]: Without dead ends: 622 [2024-11-13 16:15:35,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 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-13 16:15:35,346 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:35,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 654 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:15:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-13 16:15:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 598. [2024-11-13 16:15:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 519 states have (on average 1.2716763005780347) internal successors, (660), 521 states have internal predecessors, (660), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 788 transitions. [2024-11-13 16:15:35,402 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 788 transitions. Word has length 129 [2024-11-13 16:15:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:35,403 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 788 transitions. [2024-11-13 16:15:35,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 16:15:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 788 transitions. [2024-11-13 16:15:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 16:15:35,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:35,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:35,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-13 16:15:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:35,605 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 98272392, now seen corresponding path program 1 times [2024-11-13 16:15:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460158545] [2024-11-13 16:15:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:35,606 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-13 16:15:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:35,607 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:35,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-13 16:15:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:36,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 16:15:36,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:38,146 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 25 [2024-11-13 16:15:38,429 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 29 treesize of output 17 [2024-11-13 16:15:38,631 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 32 treesize of output 24 [2024-11-13 16:15:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-13 16:15:39,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:39,825 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-13 16:15:39,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460158545] [2024-11-13 16:15:39,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460158545] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:39,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:39,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 27 [2024-11-13 16:15:39,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499281202] [2024-11-13 16:15:39,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:39,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:39,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-11-13 16:15:39,827 INFO L87 Difference]: Start difference. First operand 598 states and 788 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-13 16:15:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:40,372 INFO L93 Difference]: Finished difference Result 1317 states and 1749 transitions. [2024-11-13 16:15:40,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:15:40,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 129 [2024-11-13 16:15:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:40,376 INFO L225 Difference]: With dead ends: 1317 [2024-11-13 16:15:40,376 INFO L226 Difference]: Without dead ends: 885 [2024-11-13 16:15:40,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2024-11-13 16:15:40,378 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 238 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:40,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 769 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:15:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-13 16:15:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 631. [2024-11-13 16:15:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 552 states have (on average 1.2681159420289856) internal successors, (700), 554 states have internal predecessors, (700), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 828 transitions. [2024-11-13 16:15:40,422 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 828 transitions. Word has length 129 [2024-11-13 16:15:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:40,423 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 828 transitions. [2024-11-13 16:15:40,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-13 16:15:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 828 transitions. [2024-11-13 16:15:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:15:40,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:40,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-13 16:15:40,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:40,627 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:40,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash 692115325, now seen corresponding path program 1 times [2024-11-13 16:15:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:40,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434533930] [2024-11-13 16:15:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:40,628 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-13 16:15:40,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:40,629 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:40,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-13 16:15:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:41,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 16:15:41,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:43,240 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 25 [2024-11-13 16:15:43,556 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 29 treesize of output 17 [2024-11-13 16:15:43,728 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 32 treesize of output 24 [2024-11-13 16:15:44,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:44,694 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 65 treesize of output 31 [2024-11-13 16:15:44,708 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 50 treesize of output 34 [2024-11-13 16:15:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-13 16:15:44,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:45,466 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-13 16:15:45,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434533930] [2024-11-13 16:15:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434533930] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:45,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:45,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [23] total 28 [2024-11-13 16:15:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486777848] [2024-11-13 16:15:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-11-13 16:15:45,468 INFO L87 Difference]: Start difference. First operand 631 states and 828 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-13 16:15:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:45,974 INFO L93 Difference]: Finished difference Result 1255 states and 1656 transitions. [2024-11-13 16:15:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:15:45,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 130 [2024-11-13 16:15:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:45,978 INFO L225 Difference]: With dead ends: 1255 [2024-11-13 16:15:45,978 INFO L226 Difference]: Without dead ends: 790 [2024-11-13 16:15:45,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2024-11-13 16:15:45,981 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 226 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:45,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 538 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:15:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-13 16:15:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 631. [2024-11-13 16:15:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 552 states have (on average 1.2644927536231885) internal successors, (698), 554 states have internal predecessors, (698), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 826 transitions. [2024-11-13 16:15:46,027 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 826 transitions. Word has length 130 [2024-11-13 16:15:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:46,027 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 826 transitions. [2024-11-13 16:15:46,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-13 16:15:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 826 transitions. [2024-11-13 16:15:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:15:46,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:46,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:46,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-13 16:15:46,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:46,230 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:46,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1146040349, now seen corresponding path program 1 times [2024-11-13 16:15:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190718162] [2024-11-13 16:15:46,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:46,231 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-13 16:15:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:46,233 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:46,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-13 16:15:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:46,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:46,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:15:47,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:47,562 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-13 16:15:47,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190718162] [2024-11-13 16:15:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190718162] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:15:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 16:15:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974851315] [2024-11-13 16:15:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:15:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:15:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:15:47,564 INFO L87 Difference]: Start difference. First operand 631 states and 826 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-13 16:15:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:47,742 INFO L93 Difference]: Finished difference Result 1279 states and 1677 transitions. [2024-11-13 16:15:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:15:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 130 [2024-11-13 16:15:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:47,747 INFO L225 Difference]: With dead ends: 1279 [2024-11-13 16:15:47,747 INFO L226 Difference]: Without dead ends: 711 [2024-11-13 16:15:47,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:47,748 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 58 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:47,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 581 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:15:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-13 16:15:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 647. [2024-11-13 16:15:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 568 states have (on average 1.2623239436619718) internal successors, (717), 570 states have internal predecessors, (717), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 845 transitions. [2024-11-13 16:15:47,794 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 845 transitions. Word has length 130 [2024-11-13 16:15:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:47,794 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 845 transitions. [2024-11-13 16:15:47,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-13 16:15:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 845 transitions. [2024-11-13 16:15:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:15:47,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:47,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:47,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-13 16:15:47,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:47,997 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:47,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1546470228, now seen corresponding path program 1 times [2024-11-13 16:15:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877621132] [2024-11-13 16:15:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 16:15:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:48,000 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:48,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-13 16:15:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:48,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 16:15:48,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:49,012 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-13 16:15:49,185 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 27 treesize of output 11 [2024-11-13 16:15:49,326 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 15 treesize of output 7 [2024-11-13 16:15:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 16:15:49,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:49,356 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877621132] [2024-11-13 16:15:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877621132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:49,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:15:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511433710] [2024-11-13 16:15:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:15:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:15:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:15:49,357 INFO L87 Difference]: Start difference. First operand 647 states and 845 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (12), 1 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-13 16:15:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:50,323 INFO L93 Difference]: Finished difference Result 1457 states and 1902 transitions. [2024-11-13 16:15:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:15:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (12), 1 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 130 [2024-11-13 16:15:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:50,327 INFO L225 Difference]: With dead ends: 1457 [2024-11-13 16:15:50,327 INFO L226 Difference]: Without dead ends: 873 [2024-11-13 16:15:50,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:15:50,329 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 240 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:50,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 921 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:15:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-13 16:15:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 769. [2024-11-13 16:15:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 690 states have (on average 1.2608695652173914) internal successors, (870), 692 states have internal predecessors, (870), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 998 transitions. [2024-11-13 16:15:50,372 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 998 transitions. Word has length 130 [2024-11-13 16:15:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:50,374 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 998 transitions. [2024-11-13 16:15:50,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (12), 1 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-13 16:15:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 998 transitions. [2024-11-13 16:15:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:15:50,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:50,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:50,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-13 16:15:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:50,576 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash 845405650, now seen corresponding path program 1 times [2024-11-13 16:15:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909639904] [2024-11-13 16:15:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:50,577 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-13 16:15:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:50,579 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:50,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-13 16:15:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:51,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:15:51,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:51,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 16:15:51,727 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-13 16:15:51,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:51,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:51,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909639904] [2024-11-13 16:15:51,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909639904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:51,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:15:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396517941] [2024-11-13 16:15:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:51,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:15:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:15:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:15:51,729 INFO L87 Difference]: Start difference. First operand 769 states and 998 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 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-13 16:15:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:52,935 INFO L93 Difference]: Finished difference Result 1552 states and 2016 transitions. [2024-11-13 16:15:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:15:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 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 130 [2024-11-13 16:15:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:52,944 INFO L225 Difference]: With dead ends: 1552 [2024-11-13 16:15:52,944 INFO L226 Difference]: Without dead ends: 867 [2024-11-13 16:15:52,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:15:52,947 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 260 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:52,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1783 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:15:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-13 16:15:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 769. [2024-11-13 16:15:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 690 states have (on average 1.2594202898550724) internal successors, (869), 692 states have internal predecessors, (869), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 16:15:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 997 transitions. [2024-11-13 16:15:53,008 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 997 transitions. Word has length 130 [2024-11-13 16:15:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:53,008 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 997 transitions. [2024-11-13 16:15:53,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 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-13 16:15:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 997 transitions. [2024-11-13 16:15:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:15:53,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:53,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:53,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-13 16:15:53,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:53,216 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:53,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2021706195, now seen corresponding path program 1 times [2024-11-13 16:15:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432016863] [2024-11-13 16:15:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:53,218 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-13 16:15:53,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:53,220 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:53,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-13 16:15:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:53,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 16:15:53,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:55,119 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 25 [2024-11-13 16:15:55,378 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 20 treesize of output 12 [2024-11-13 16:15:55,513 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 32 treesize of output 24 [2024-11-13 16:15:55,646 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 26 treesize of output 18 [2024-11-13 16:15:55,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:55,805 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 53 treesize of output 23 [2024-11-13 16:15:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 16:15:55,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:55,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432016863] [2024-11-13 16:15:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432016863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 16:15:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269292614] [2024-11-13 16:15:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:15:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:15:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:15:55,932 INFO L87 Difference]: Start difference. First operand 769 states and 997 transitions. Second operand has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 3 states have call successors, (12), 2 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-13 16:15:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:58,491 INFO L93 Difference]: Finished difference Result 1350 states and 1751 transitions. [2024-11-13 16:15:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 16:15:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 131 [2024-11-13 16:15:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:58,495 INFO L225 Difference]: With dead ends: 1350 [2024-11-13 16:15:58,495 INFO L226 Difference]: Without dead ends: 831 [2024-11-13 16:15:58,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2024-11-13 16:15:58,497 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 380 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:58,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1929 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 16:15:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-13 16:15:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 813. [2024-11-13 16:15:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 719 states have (on average 1.2517385257301807) internal successors, (900), 722 states have internal predecessors, (900), 74 states have call successors, (74), 19 states have call predecessors, (74), 19 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-13 16:15:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1048 transitions. [2024-11-13 16:15:58,578 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1048 transitions. Word has length 131 [2024-11-13 16:15:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:58,579 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1048 transitions. [2024-11-13 16:15:58,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 3 states have call successors, (12), 2 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-13 16:15:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1048 transitions. [2024-11-13 16:15:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:15:58,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:58,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:15:58,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-13 16:15:58,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:58,783 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:15:58,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1309658846, now seen corresponding path program 1 times [2024-11-13 16:15:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:15:58,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205679827] [2024-11-13 16:15:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:58,784 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-13 16:15:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:15:58,786 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:15:58,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-13 16:15:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:59,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:15:59,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:59,238 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 30 treesize of output 25 [2024-11-13 16:15:59,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:15:59,279 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 20 [2024-11-13 16:15:59,324 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-13 16:15:59,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:15:59,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:15:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205679827] [2024-11-13 16:15:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205679827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:15:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:15:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:15:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691213328] [2024-11-13 16:15:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:15:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:15:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:15:59,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:15:59,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:15:59,326 INFO L87 Difference]: Start difference. First operand 813 states and 1048 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-13 16:15:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:59,927 INFO L93 Difference]: Finished difference Result 1549 states and 2015 transitions. [2024-11-13 16:15:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:15:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 131 [2024-11-13 16:15:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:59,931 INFO L225 Difference]: With dead ends: 1549 [2024-11-13 16:15:59,932 INFO L226 Difference]: Without dead ends: 1053 [2024-11-13 16:15:59,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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-13 16:15:59,933 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 252 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:59,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 907 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:15:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-13 16:16:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 762. [2024-11-13 16:16:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 667 states have (on average 1.2488755622188905) internal successors, (833), 670 states have internal predecessors, (833), 74 states have call successors, (74), 20 states have call predecessors, (74), 20 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-13 16:16:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 981 transitions. [2024-11-13 16:16:00,011 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 981 transitions. Word has length 131 [2024-11-13 16:16:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:00,012 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 981 transitions. [2024-11-13 16:16:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-13 16:16:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 981 transitions. [2024-11-13 16:16:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:16:00,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:00,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:16:00,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-13 16:16:00,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:00,215 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1763788011, now seen corresponding path program 1 times [2024-11-13 16:16:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66567889] [2024-11-13 16:16:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:00,216 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-13 16:16:00,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:00,219 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:00,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-13 16:16:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:00,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 16:16:00,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:02,433 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 25 [2024-11-13 16:16:02,797 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 20 treesize of output 12 [2024-11-13 16:16:02,975 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 23 [2024-11-13 16:16:03,148 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 25 treesize of output 17 [2024-11-13 16:16:03,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:16:03,339 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 60 treesize of output 26 [2024-11-13 16:16:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 16:16:03,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:03,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:03,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66567889] [2024-11-13 16:16:03,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66567889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:03,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:03,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 16:16:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639578941] [2024-11-13 16:16:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:03,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:16:03,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:03,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:16:03,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:16:03,487 INFO L87 Difference]: Start difference. First operand 762 states and 981 transitions. Second operand has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 3 states have call successors, (12), 2 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-13 16:16:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:06,632 INFO L93 Difference]: Finished difference Result 1278 states and 1657 transitions. [2024-11-13 16:16:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 16:16:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 131 [2024-11-13 16:16:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:06,636 INFO L225 Difference]: With dead ends: 1278 [2024-11-13 16:16:06,636 INFO L226 Difference]: Without dead ends: 816 [2024-11-13 16:16:06,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2024-11-13 16:16:06,638 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 281 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:06,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1773 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 16:16:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-13 16:16:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 685. [2024-11-13 16:16:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 594 states have (on average 1.2508417508417509) internal successors, (743), 598 states have internal predecessors, (743), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 887 transitions. [2024-11-13 16:16:06,693 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 887 transitions. Word has length 131 [2024-11-13 16:16:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:06,694 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 887 transitions. [2024-11-13 16:16:06,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 3 states have call successors, (12), 2 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-13 16:16:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 887 transitions. [2024-11-13 16:16:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:16:06,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:06,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:16:06,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-11-13 16:16:06,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:06,896 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:06,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2121340687, now seen corresponding path program 1 times [2024-11-13 16:16:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261945588] [2024-11-13 16:16:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:06,897 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-13 16:16:06,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:06,902 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:06,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-13 16:16:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:07,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 16:16:07,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:08,007 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-13 16:16:08,555 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 25 [2024-11-13 16:16:09,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:16:09,256 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 18 [2024-11-13 16:16:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 16:16:09,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:09,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:09,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261945588] [2024-11-13 16:16:09,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261945588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:09,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 16:16:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478593922] [2024-11-13 16:16:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:09,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:16:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:16:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:16:09,522 INFO L87 Difference]: Start difference. First operand 685 states and 887 transitions. Second operand has 19 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (12), 2 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-13 16:16:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:12,999 INFO L93 Difference]: Finished difference Result 1191 states and 1550 transitions. [2024-11-13 16:16:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 16:16:13,000 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 132 [2024-11-13 16:16:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:13,004 INFO L225 Difference]: With dead ends: 1191 [2024-11-13 16:16:13,004 INFO L226 Difference]: Without dead ends: 700 [2024-11-13 16:16:13,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 16:16:13,006 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 390 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:13,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 2101 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 16:16:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-13 16:16:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 688. [2024-11-13 16:16:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 597 states have (on average 1.2495812395309882) internal successors, (746), 601 states have internal predecessors, (746), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 890 transitions. [2024-11-13 16:16:13,066 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 890 transitions. Word has length 132 [2024-11-13 16:16:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 890 transitions. [2024-11-13 16:16:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (12), 2 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-13 16:16:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 890 transitions. [2024-11-13 16:16:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:16:13,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:13,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, 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-13 16:16:13,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-13 16:16:13,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:13,269 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:13,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1872991910, now seen corresponding path program 1 times [2024-11-13 16:16:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063014829] [2024-11-13 16:16:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:13,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-13 16:16:13,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:13,272 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:13,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-13 16:16:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:13,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:16:13,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:14,642 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 33 treesize of output 15 [2024-11-13 16:16:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:16:14,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:16:15,030 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-13 16:16:15,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063014829] [2024-11-13 16:16:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063014829] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:16:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:16:15,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-13 16:16:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886248182] [2024-11-13 16:16:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:15,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:16:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:15,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:16:15,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:16:15,032 INFO L87 Difference]: Start difference. First operand 688 states and 890 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 16:16:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:15,256 INFO L93 Difference]: Finished difference Result 1181 states and 1540 transitions. [2024-11-13 16:16:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:16:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 132 [2024-11-13 16:16:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:15,261 INFO L225 Difference]: With dead ends: 1181 [2024-11-13 16:16:15,262 INFO L226 Difference]: Without dead ends: 681 [2024-11-13 16:16:15,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:16:15,264 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 110 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:15,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 503 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:16:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-13 16:16:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 679. [2024-11-13 16:16:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 588 states have (on average 1.2431972789115646) internal successors, (731), 592 states have internal predecessors, (731), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 875 transitions. [2024-11-13 16:16:15,335 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 875 transitions. Word has length 132 [2024-11-13 16:16:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:15,336 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 875 transitions. [2024-11-13 16:16:15,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 16:16:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 875 transitions. [2024-11-13 16:16:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:16:15,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:15,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:16:15,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-13 16:16:15,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:15,538 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 307790372, now seen corresponding path program 1 times [2024-11-13 16:16:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685834517] [2024-11-13 16:16:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:15,539 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-13 16:16:15,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:15,541 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:15,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-13 16:16:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:16,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:16:16,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:16,214 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-13 16:16:16,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:16,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:16,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685834517] [2024-11-13 16:16:16,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685834517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:16:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231731773] [2024-11-13 16:16:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:16:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:16:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:16:16,216 INFO L87 Difference]: Start difference. First operand 679 states and 875 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 16:16:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:16,321 INFO L93 Difference]: Finished difference Result 1320 states and 1704 transitions. [2024-11-13 16:16:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:16:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 132 [2024-11-13 16:16:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:16,326 INFO L225 Difference]: With dead ends: 1320 [2024-11-13 16:16:16,326 INFO L226 Difference]: Without dead ends: 697 [2024-11-13 16:16:16,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-13 16:16:16,328 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:16,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:16:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-13 16:16:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-13 16:16:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 606 states have (on average 1.2359735973597359) internal successors, (749), 610 states have internal predecessors, (749), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 893 transitions. [2024-11-13 16:16:16,395 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 893 transitions. Word has length 132 [2024-11-13 16:16:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:16,396 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 893 transitions. [2024-11-13 16:16:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 16:16:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 893 transitions. [2024-11-13 16:16:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:16:16,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:16,397 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, 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-13 16:16:16,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-13 16:16:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:16,598 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 58818089, now seen corresponding path program 1 times [2024-11-13 16:16:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538144358] [2024-11-13 16:16:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:16,599 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-13 16:16:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:16,601 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:16,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-13 16:16:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:17,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:16:17,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 16:16:18,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:16:18,298 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-13 16:16:18,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:18,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538144358] [2024-11-13 16:16:18,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538144358] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:16:18,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:16:18,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 16:16:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117457481] [2024-11-13 16:16:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:18,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:16:18,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:16:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:16:18,300 INFO L87 Difference]: Start difference. First operand 697 states and 893 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-13 16:16:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:18,512 INFO L93 Difference]: Finished difference Result 1329 states and 1702 transitions. [2024-11-13 16:16:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:16:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 134 [2024-11-13 16:16:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:18,517 INFO L225 Difference]: With dead ends: 1329 [2024-11-13 16:16:18,517 INFO L226 Difference]: Without dead ends: 688 [2024-11-13 16:16:18,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:16:18,519 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 92 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:18,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 436 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:16:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-13 16:16:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2024-11-13 16:16:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 595 states have (on average 1.2285714285714286) internal successors, (731), 599 states have internal predecessors, (731), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 875 transitions. [2024-11-13 16:16:18,587 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 875 transitions. Word has length 134 [2024-11-13 16:16:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:18,587 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 875 transitions. [2024-11-13 16:16:18,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-13 16:16:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 875 transitions. [2024-11-13 16:16:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:16:18,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:18,589 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, 1, 1, 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-13 16:16:18,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2024-11-13 16:16:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:18,789 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1642324424, now seen corresponding path program 1 times [2024-11-13 16:16:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363592265] [2024-11-13 16:16:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:18,791 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-13 16:16:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:18,792 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:18,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-13 16:16:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:19,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 16:16:19,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:19,624 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-13 16:16:19,701 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 26 treesize of output 22 [2024-11-13 16:16:19,762 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 37 treesize of output 36 [2024-11-13 16:16:20,093 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 32 treesize of output 20 [2024-11-13 16:16:20,099 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 24 treesize of output 16 [2024-11-13 16:16:20,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:16:20,162 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 33 treesize of output 19 [2024-11-13 16:16:20,354 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-13 16:16:20,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:20,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:20,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363592265] [2024-11-13 16:16:20,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363592265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:20,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:20,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:16:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705155172] [2024-11-13 16:16:20,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:20,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:16:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:20,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:16:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:16:20,356 INFO L87 Difference]: Start difference. First operand 686 states and 875 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-13 16:16:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:22,227 INFO L93 Difference]: Finished difference Result 1536 states and 1968 transitions. [2024-11-13 16:16:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:16:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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 136 [2024-11-13 16:16:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:22,232 INFO L225 Difference]: With dead ends: 1536 [2024-11-13 16:16:22,232 INFO L226 Difference]: Without dead ends: 1051 [2024-11-13 16:16:22,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:16:22,233 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 265 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:22,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1703 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 16:16:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-13 16:16:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 741. [2024-11-13 16:16:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 650 states have (on average 1.2230769230769232) internal successors, (795), 654 states have internal predecessors, (795), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 939 transitions. [2024-11-13 16:16:22,299 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 939 transitions. Word has length 136 [2024-11-13 16:16:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:22,300 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 939 transitions. [2024-11-13 16:16:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-13 16:16:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 939 transitions. [2024-11-13 16:16:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:16:22,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:22,302 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, 1, 1, 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-13 16:16:22,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2024-11-13 16:16:22,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:22,503 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:22,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1972584502, now seen corresponding path program 1 times [2024-11-13 16:16:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377610739] [2024-11-13 16:16:22,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:22,504 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-13 16:16:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:22,507 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:22,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-13 16:16:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:23,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 16:16:23,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:23,271 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-13 16:16:23,320 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 24 treesize of output 23 [2024-11-13 16:16:23,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:16:23,537 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 28 treesize of output 14 [2024-11-13 16:16:23,571 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-13 16:16:23,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:23,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377610739] [2024-11-13 16:16:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377610739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:16:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207768190] [2024-11-13 16:16:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:16:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:16:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:16:23,573 INFO L87 Difference]: Start difference. First operand 741 states and 939 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-13 16:16:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:24,114 INFO L93 Difference]: Finished difference Result 1564 states and 2003 transitions. [2024-11-13 16:16:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:16:24,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 136 [2024-11-13 16:16:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:24,119 INFO L225 Difference]: With dead ends: 1564 [2024-11-13 16:16:24,119 INFO L226 Difference]: Without dead ends: 1039 [2024-11-13 16:16:24,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:16:24,120 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 187 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:24,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1065 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:16:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-13 16:16:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 789. [2024-11-13 16:16:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 698 states have (on average 1.2249283667621778) internal successors, (855), 702 states have internal predecessors, (855), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 999 transitions. [2024-11-13 16:16:24,184 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 999 transitions. Word has length 136 [2024-11-13 16:16:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:24,184 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 999 transitions. [2024-11-13 16:16:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-13 16:16:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 999 transitions. [2024-11-13 16:16:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:16:24,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:24,185 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, 1, 1, 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-13 16:16:24,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2024-11-13 16:16:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:24,386 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1569937866, now seen corresponding path program 1 times [2024-11-13 16:16:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136760293] [2024-11-13 16:16:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:24,387 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-13 16:16:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:24,389 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:24,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-13 16:16:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:25,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 16:16:25,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:25,178 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-13 16:16:25,251 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 25 treesize of output 24 [2024-11-13 16:16:25,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:16:25,542 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 29 treesize of output 15 [2024-11-13 16:16:25,587 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-13 16:16:25,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:25,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136760293] [2024-11-13 16:16:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136760293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:16:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480083535] [2024-11-13 16:16:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:25,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:16:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:16:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:16:25,590 INFO L87 Difference]: Start difference. First operand 789 states and 999 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-13 16:16:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:26,946 INFO L93 Difference]: Finished difference Result 1622 states and 2073 transitions. [2024-11-13 16:16:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:16:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 136 [2024-11-13 16:16:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:26,951 INFO L225 Difference]: With dead ends: 1622 [2024-11-13 16:16:26,951 INFO L226 Difference]: Without dead ends: 1049 [2024-11-13 16:16:26,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:16:26,953 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 189 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:26,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 991 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 16:16:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-13 16:16:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 789. [2024-11-13 16:16:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 698 states have (on average 1.2206303724928367) internal successors, (852), 702 states have internal predecessors, (852), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 996 transitions. [2024-11-13 16:16:27,037 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 996 transitions. Word has length 136 [2024-11-13 16:16:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:27,038 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 996 transitions. [2024-11-13 16:16:27,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-13 16:16:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 996 transitions. [2024-11-13 16:16:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:16:27,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:27,039 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, 1, 1, 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-13 16:16:27,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2024-11-13 16:16:27,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:27,244 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:27,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2044971060, now seen corresponding path program 1 times [2024-11-13 16:16:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062358386] [2024-11-13 16:16:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:27,246 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-13 16:16:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:27,248 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:27,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-11-13 16:16:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:28,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 16:16:28,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:28,053 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-13 16:16:28,105 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 25 treesize of output 21 [2024-11-13 16:16:28,167 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 36 treesize of output 35 [2024-11-13 16:16:28,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 16:16:28,522 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 15 [2024-11-13 16:16:28,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:16:28,586 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 31 treesize of output 17 [2024-11-13 16:16:28,783 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-13 16:16:28,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:16:28,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:16:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062358386] [2024-11-13 16:16:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062358386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:16:28,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:16:28,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:16:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119662717] [2024-11-13 16:16:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:16:28,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:16:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:16:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:16:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:16:28,786 INFO L87 Difference]: Start difference. First operand 789 states and 996 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-13 16:16:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:31,022 INFO L93 Difference]: Finished difference Result 1620 states and 2062 transitions. [2024-11-13 16:16:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:16:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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 136 [2024-11-13 16:16:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:31,027 INFO L225 Difference]: With dead ends: 1620 [2024-11-13 16:16:31,027 INFO L226 Difference]: Without dead ends: 1057 [2024-11-13 16:16:31,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:16:31,028 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 192 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:31,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 2104 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 16:16:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-13 16:16:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 793. [2024-11-13 16:16:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 702 states have (on average 1.2207977207977208) internal successors, (857), 706 states have internal predecessors, (857), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 16:16:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1001 transitions. [2024-11-13 16:16:31,075 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1001 transitions. Word has length 136 [2024-11-13 16:16:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:31,075 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1001 transitions. [2024-11-13 16:16:31,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-13 16:16:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1001 transitions. [2024-11-13 16:16:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:16:31,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:31,077 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, 1, 1, 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-13 16:16:31,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2024-11-13 16:16:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:31,277 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:31,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1749598469, now seen corresponding path program 1 times [2024-11-13 16:16:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:16:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042492988] [2024-11-13 16:16:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:31,279 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-13 16:16:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:16:31,281 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 16:16:31,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1d55cc6-bb44-4116-a0c8-d30594ba58e8/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process