./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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 f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:11:58,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:11:58,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:11:58,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:11:58,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:11:58,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:11:58,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:11:58,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:11:58,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:11:58,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:11:58,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:11:58,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:11:58,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:11:58,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:11:58,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:11:58,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:11:58,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:11:58,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:11:58,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:11:58,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:11:58,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:11:58,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:11:58,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:11:58,247 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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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 -> f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a [2024-11-13 16:11:58,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:11:58,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:11:58,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:11:58,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:11:58,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:11:58,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i Unable to find full path for "g++" [2024-11-13 16:12:01,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:12:01,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:12:01,337 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2024-11-13 16:12:01,349 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data/0fb3d3a9d/ecd43970d67a408882aa9e7417d56e8d/FLAGab1ad69fc [2024-11-13 16:12:01,365 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data/0fb3d3a9d/ecd43970d67a408882aa9e7417d56e8d [2024-11-13 16:12:01,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:12:01,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:12:01,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:12:01,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:12:01,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:12:01,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755ef848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01, skipping insertion in model container [2024-11-13 16:12:01,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:12:01,561 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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2024-11-13 16:12:01,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:12:01,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:12:01,675 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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2024-11-13 16:12:01,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:12:01,753 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:12:01,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01 WrapperNode [2024-11-13 16:12:01,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:12:01,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:12:01,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:12:01,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:12:01,763 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:12:01" (1/1) ... [2024-11-13 16:12:01,787 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:12:01" (1/1) ... [2024-11-13 16:12:01,859 INFO L138 Inliner]: procedures = 29, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-11-13 16:12:01,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:12:01,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:12:01,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:12:01,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:12:01,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,926 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 52, 59, 19, 3, 17]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 4, 3, 1, 1]. The 17 writes are split as follows [0, 6, 5, 4, 1, 1]. [2024-11-13 16:12:01,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:01,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:12:01,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:12:02,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:12:02,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:12:02,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (1/1) ... [2024-11-13 16:12:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:12:02,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:12:02,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:02,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:12:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:12:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:12:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:12:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 16:12:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 16:12:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 16:12:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 16:12:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 16:12:02,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 16:12:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:12:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:12:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:12:02,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 16:12:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 16:12:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 16:12:02,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 16:12:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 16:12:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 16:12:02,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 16:12:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 16:12:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 16:12:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:12:02,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:12:02,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:12:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:12:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:12:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 16:12:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 16:12:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 16:12:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:12:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:12:02,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:12:02,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:12:02,947 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-11-13 16:12:02,947 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:12:02,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:12:02,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:12:02,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:12:02 BoogieIcfgContainer [2024-11-13 16:12:02,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:12:02,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:12:02,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:12:02,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:12:02,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:12:01" (1/3) ... [2024-11-13 16:12:02,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb0c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:12:02, skipping insertion in model container [2024-11-13 16:12:02,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:01" (2/3) ... [2024-11-13 16:12:02,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb0c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:12:02, skipping insertion in model container [2024-11-13 16:12:02,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:12:02" (3/3) ... [2024-11-13 16:12:02,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-28.i [2024-11-13 16:12:02,999 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:12:03,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-28.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:12:03,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:12:03,102 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;@27fecff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:12:03,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:12:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:12:03,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:03,124 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:03,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1523642456, now seen corresponding path program 1 times [2024-11-13 16:12:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14850138] [2024-11-13 16:12:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14850138] [2024-11-13 16:12:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14850138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:03,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:03,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:12:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423427624] [2024-11-13 16:12:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:03,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:12:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:03,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:12:03,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:12:03,663 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:03,706 INFO L93 Difference]: Finished difference Result 239 states and 368 transitions. [2024-11-13 16:12:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:12:03,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-13 16:12:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:03,715 INFO L225 Difference]: With dead ends: 239 [2024-11-13 16:12:03,715 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 16:12:03,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:12:03,754 INFO L432 NwaCegarLoop]: 171 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, 171 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:12:03,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 16:12:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 16:12:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-13 16:12:03,817 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2024-11-13 16:12:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-13 16:12:03,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-13 16:12:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:12:03,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:03,822 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:12:03,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:03,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2011392364, now seen corresponding path program 1 times [2024-11-13 16:12:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:03,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132552740] [2024-11-13 16:12:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:03,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132552740] [2024-11-13 16:12:04,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132552740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:04,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:04,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:12:04,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557802962] [2024-11-13 16:12:04,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:04,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:12:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:12:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:04,401 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:04,477 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2024-11-13 16:12:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:12:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-13 16:12:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:04,482 INFO L225 Difference]: With dead ends: 237 [2024-11-13 16:12:04,482 INFO L226 Difference]: Without dead ends: 121 [2024-11-13 16:12:04,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:04,486 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:04,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-13 16:12:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-13 16:12:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-13 16:12:04,506 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2024-11-13 16:12:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:04,507 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-13 16:12:04,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-13 16:12:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:12:04,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:04,511 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:04,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:12:04,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:04,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1950931794, now seen corresponding path program 1 times [2024-11-13 16:12:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:04,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635436651] [2024-11-13 16:12:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:04,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635436651] [2024-11-13 16:12:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635436651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:12:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747009951] [2024-11-13 16:12:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:04,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:12:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:12:04,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:04,975 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:05,028 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2024-11-13 16:12:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:12:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-13 16:12:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:05,033 INFO L225 Difference]: With dead ends: 242 [2024-11-13 16:12:05,033 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 16:12:05,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:05,034 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:05,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 16:12:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-13 16:12:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-13 16:12:05,058 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2024-11-13 16:12:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:05,059 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-13 16:12:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-13 16:12:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:12:05,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:05,061 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:12:05,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:05,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -175924432, now seen corresponding path program 1 times [2024-11-13 16:12:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859771119] [2024-11-13 16:12:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859771119] [2024-11-13 16:12:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859771119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:05,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:12:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500845668] [2024-11-13 16:12:05,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:05,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:12:05,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:05,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:12:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:05,363 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:05,399 INFO L93 Difference]: Finished difference Result 246 states and 351 transitions. [2024-11-13 16:12:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:12:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-13 16:12:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:05,407 INFO L225 Difference]: With dead ends: 246 [2024-11-13 16:12:05,407 INFO L226 Difference]: Without dead ends: 126 [2024-11-13 16:12:05,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:05,408 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:05,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-13 16:12:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-11-13 16:12:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2024-11-13 16:12:05,428 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 130 [2024-11-13 16:12:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:05,428 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2024-11-13 16:12:05,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2024-11-13 16:12:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:12:05,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:05,430 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:12:05,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -174077390, now seen corresponding path program 1 times [2024-11-13 16:12:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652057269] [2024-11-13 16:12:05,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652057269] [2024-11-13 16:12:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652057269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742682227] [2024-11-13 16:12:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:12:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:12:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:12:06,243 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:06,500 INFO L93 Difference]: Finished difference Result 349 states and 495 transitions. [2024-11-13 16:12:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:12:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-13 16:12:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:06,502 INFO L225 Difference]: With dead ends: 349 [2024-11-13 16:12:06,502 INFO L226 Difference]: Without dead ends: 227 [2024-11-13 16:12:06,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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:12:06,503 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 126 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:06,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 717 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:12:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-13 16:12:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2024-11-13 16:12:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.3768844221105527) internal successors, (274), 200 states have internal predecessors, (274), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 16:12:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 318 transitions. [2024-11-13 16:12:06,534 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 318 transitions. Word has length 130 [2024-11-13 16:12:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:06,535 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 318 transitions. [2024-11-13 16:12:06,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 318 transitions. [2024-11-13 16:12:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:12:06,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:06,539 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:06,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:12:06,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:06,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2093631620, now seen corresponding path program 1 times [2024-11-13 16:12:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054527859] [2024-11-13 16:12:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:06,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:06,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054527859] [2024-11-13 16:12:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054527859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:06,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:06,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879142984] [2024-11-13 16:12:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:12:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:12:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:12:06,894 INFO L87 Difference]: Start difference. First operand 224 states and 318 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:06,947 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2024-11-13 16:12:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:12:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-13 16:12:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:06,955 INFO L225 Difference]: With dead ends: 451 [2024-11-13 16:12:06,955 INFO L226 Difference]: Without dead ends: 230 [2024-11-13 16:12:06,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:12:06,957 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:06,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-13 16:12:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-13 16:12:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 206 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 16:12:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2024-11-13 16:12:06,984 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 132 [2024-11-13 16:12:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:06,984 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2024-11-13 16:12:06,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2024-11-13 16:12:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:12:06,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:06,986 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:06,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:12:06,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:06,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash -968236947, now seen corresponding path program 1 times [2024-11-13 16:12:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691273172] [2024-11-13 16:12:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691273172] [2024-11-13 16:12:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691273172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:12:07,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752846320] [2024-11-13 16:12:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:07,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:12:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:12:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:12:07,747 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:08,420 INFO L93 Difference]: Finished difference Result 875 states and 1231 transitions. [2024-11-13 16:12:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:12:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-13 16:12:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:08,424 INFO L225 Difference]: With dead ends: 875 [2024-11-13 16:12:08,425 INFO L226 Difference]: Without dead ends: 648 [2024-11-13 16:12:08,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:12:08,426 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 344 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:08,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1014 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:12:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-13 16:12:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 639. [2024-11-13 16:12:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 585 states have (on average 1.3829059829059829) internal successors, (809), 591 states have internal predecessors, (809), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 16:12:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 901 transitions. [2024-11-13 16:12:08,491 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 901 transitions. Word has length 132 [2024-11-13 16:12:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:08,492 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 901 transitions. [2024-11-13 16:12:08,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 901 transitions. [2024-11-13 16:12:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:12:08,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:08,496 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:12:08,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1989305301, now seen corresponding path program 1 times [2024-11-13 16:12:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692873678] [2024-11-13 16:12:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:09,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692873678] [2024-11-13 16:12:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692873678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:09,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48573997] [2024-11-13 16:12:09,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:12:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:12:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:12:09,146 INFO L87 Difference]: Start difference. First operand 639 states and 901 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:09,499 INFO L93 Difference]: Finished difference Result 1252 states and 1761 transitions. [2024-11-13 16:12:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:12:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-13 16:12:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:09,505 INFO L225 Difference]: With dead ends: 1252 [2024-11-13 16:12:09,505 INFO L226 Difference]: Without dead ends: 651 [2024-11-13 16:12:09,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:12:09,507 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 135 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:09,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 496 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:12:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-13 16:12:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 647. [2024-11-13 16:12:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 590 states have (on average 1.376271186440678) internal successors, (812), 596 states have internal predecessors, (812), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:12:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 908 transitions. [2024-11-13 16:12:09,589 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 908 transitions. Word has length 132 [2024-11-13 16:12:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 908 transitions. [2024-11-13 16:12:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 908 transitions. [2024-11-13 16:12:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:09,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:09,597 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:09,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:12:09,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1018731880, now seen corresponding path program 1 times [2024-11-13 16:12:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:09,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128626342] [2024-11-13 16:12:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128626342] [2024-11-13 16:12:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128626342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:12:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121578491] [2024-11-13 16:12:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:10,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:12:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:12:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:12:10,644 INFO L87 Difference]: Start difference. First operand 647 states and 908 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:11,453 INFO L93 Difference]: Finished difference Result 1289 states and 1806 transitions. [2024-11-13 16:12:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:12:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2024-11-13 16:12:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:11,459 INFO L225 Difference]: With dead ends: 1289 [2024-11-13 16:12:11,459 INFO L226 Difference]: Without dead ends: 688 [2024-11-13 16:12:11,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:12:11,465 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 479 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:11,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 748 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:12:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-13 16:12:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 675. [2024-11-13 16:12:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 606 states have (on average 1.3597359735973598) internal successors, (824), 612 states have internal predecessors, (824), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 16:12:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 940 transitions. [2024-11-13 16:12:11,551 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 940 transitions. Word has length 134 [2024-11-13 16:12:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:11,552 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 940 transitions. [2024-11-13 16:12:11,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 940 transitions. [2024-11-13 16:12:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:11,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:11,557 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:11,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:12:11,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:11,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 201083430, now seen corresponding path program 1 times [2024-11-13 16:12:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:11,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681252565] [2024-11-13 16:12:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 16:12:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681252565] [2024-11-13 16:12:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681252565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:12:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963332234] [2024-11-13 16:12:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:12:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:12:12,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:12:12,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:12:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:12,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 16:12:12,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:13,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:13,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2024-11-13 16:12:13,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:13,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 17 [2024-11-13 16:12:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-13 16:12:13,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:12:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 16:12:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963332234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:12:14,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:12:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 27 [2024-11-13 16:12:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925909843] [2024-11-13 16:12:14,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:12:14,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 16:12:14,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 16:12:14,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2024-11-13 16:12:14,494 INFO L87 Difference]: Start difference. First operand 675 states and 940 transitions. Second operand has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 8 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-13 16:12:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:16,031 INFO L93 Difference]: Finished difference Result 914 states and 1270 transitions. [2024-11-13 16:12:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:12:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 8 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) Word has length 134 [2024-11-13 16:12:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:16,034 INFO L225 Difference]: With dead ends: 914 [2024-11-13 16:12:16,035 INFO L226 Difference]: Without dead ends: 285 [2024-11-13 16:12:16,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 16:12:16,038 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 502 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:16,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1217 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 16:12:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-13 16:12:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-13 16:12:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 251 states have internal predecessors, (335), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:12:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 391 transitions. [2024-11-13 16:12:16,072 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 391 transitions. Word has length 134 [2024-11-13 16:12:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:16,072 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 391 transitions. [2024-11-13 16:12:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 8 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-13 16:12:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 391 transitions. [2024-11-13 16:12:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:16,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:16,076 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:16,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 16:12:16,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 16:12:16,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1672195950, now seen corresponding path program 1 times [2024-11-13 16:12:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485378971] [2024-11-13 16:12:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 16:12:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:12:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 16:12:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:12:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:12:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:12:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:12:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:12:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:12:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:12:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:12:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:12:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 16:12:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 16:12:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:16,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:16,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485378971] [2024-11-13 16:12:16,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485378971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:16,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:12:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620680339] [2024-11-13 16:12:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:16,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:12:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:12:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:12:16,609 INFO L87 Difference]: Start difference. First operand 285 states and 391 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:16,671 INFO L93 Difference]: Finished difference Result 524 states and 720 transitions. [2024-11-13 16:12:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:12:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-13 16:12:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:16,674 INFO L225 Difference]: With dead ends: 524 [2024-11-13 16:12:16,675 INFO L226 Difference]: Without dead ends: 285 [2024-11-13 16:12:16,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:12:16,676 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:16,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-13 16:12:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-13 16:12:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 251 states have internal predecessors, (333), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:12:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 389 transitions. [2024-11-13 16:12:16,703 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 389 transitions. Word has length 134 [2024-11-13 16:12:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:16,704 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 389 transitions. [2024-11-13 16:12:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 389 transitions. [2024-11-13 16:12:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:16,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:16,706 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:16,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:12:16,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1805122896, now seen corresponding path program 1 times [2024-11-13 16:12:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:12:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577971327] [2024-11-13 16:12:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:12:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:12:16,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:12:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:12:17,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:12:17,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:12:17,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:12:17,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:12:17,044 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:12:17,183 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:12:17,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:12:17 BoogieIcfgContainer [2024-11-13 16:12:17,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:12:17,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:12:17,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:12:17,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:12:17,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:12:02" (3/4) ... [2024-11-13 16:12:17,192 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:12:17,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:12:17,194 INFO L158 Benchmark]: Toolchain (without parser) took 15824.81ms. Allocated memory was 109.1MB in the beginning and 251.7MB in the end (delta: 142.6MB). Free memory was 83.4MB in the beginning and 129.3MB in the end (delta: -45.9MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-11-13 16:12:17,195 INFO L158 Benchmark]: CDTParser took 2.12ms. Allocated memory is still 83.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:12:17,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.95ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 67.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:12:17,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.75ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 63.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:12:17,195 INFO L158 Benchmark]: Boogie Preprocessor took 135.31ms. Allocated memory is still 109.1MB. Free memory was 63.1MB in the beginning and 58.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:12:17,196 INFO L158 Benchmark]: RCFGBuilder took 972.67ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 67.2MB in the end (delta: -8.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-13 16:12:17,196 INFO L158 Benchmark]: TraceAbstraction took 14214.03ms. Allocated memory was 109.1MB in the beginning and 251.7MB in the end (delta: 142.6MB). Free memory was 66.6MB in the beginning and 129.3MB in the end (delta: -62.7MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2024-11-13 16:12:17,196 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 251.7MB. Free memory was 129.3MB in the beginning and 129.3MB in the end (delta: 22.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:12:17,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.12ms. Allocated memory is still 83.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.95ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 67.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.75ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 63.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 135.31ms. Allocated memory is still 109.1MB. Free memory was 63.1MB in the beginning and 58.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 972.67ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 67.2MB in the end (delta: -8.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14214.03ms. Allocated memory was 109.1MB in the beginning and 251.7MB in the end (delta: 142.6MB). Free memory was 66.6MB in the beginning and 129.3MB in the end (delta: -62.7MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 251.7MB. Free memory was 129.3MB in the beginning and 129.3MB in the end (delta: 22.2kB). 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 someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; VAL [float_Array_0={4:0}, isInitial=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] float_Array_0[0][0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0][0] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L61] EXPR float_Array_0[0][0] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] float_Array_0[0][1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[0][1] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F [L63] EXPR float_Array_0[0][1] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR (float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR (float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] float_Array_0[0][2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0][2] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F [L65] EXPR float_Array_0[0][2] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not((float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not((float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] float_Array_0[1][2] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1][2] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F [L67] EXPR float_Array_0[1][2] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L69] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L72] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L75] EXPR signed_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR signed_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L78] EXPR signed_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= 1073741822) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_long_int_Array_0[1] >= 1073741822) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR signed_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] signed_long_int_Array_0[2] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[2] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[2] >= 1073741823) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR signed_long_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[2] <= 2147483646) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[2] <= 2147483646) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L40] signed long int stepLocal_0 = -4; [L41] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L41] COND TRUE stepLocal_0 < signed_char_Array_0[1][0] [L42] EXPR float_Array_0[0][0] [L42] EXPR float_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L42] EXPR ((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) [L42] EXPR float_Array_0[0][0] [L42] EXPR ((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L42] float_Array_0[1][0] = ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))) [L44] EXPR float_Array_0[0][0] [L44] EXPR float_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) [L44] EXPR float_Array_0[0][0] [L44] EXPR ((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] float_Array_0[1][1] = ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))) [L45] EXPR signed_char_Array_0[0][1] [L45] signed_short_int_Array_0[0] = signed_char_Array_0[0][1] [L46] EXPR signed_char_Array_0[1][0] [L46] unsigned_short_int_Array_0[0] = signed_char_Array_0[1][0] [L47] EXPR float_Array_0[1][2] [L47] EXPR float_Array_0[0][2] [L47] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L47] COND FALSE !((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) [L50] EXPR signed_char_Array_0[0][1] [L50] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L52] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1][0] | 5 VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] signed long int stepLocal_1 = signed_char_Array_0[1][0] | 5; [L53] EXPR signed_char_Array_0[0][1] [L53] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR ((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]) [L53] EXPR signed_char_Array_0[0][1] [L53] EXPR ((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=5, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(stepLocal_1 <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) [L56] EXPR signed_char_Array_0[1][0] [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR unsigned_short_int_Array_0[0] [L56] signed_long_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])) [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR float_Array_0[1][2] [L87] EXPR float_Array_0[0][2] [L87] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L87] EXPR signed_char_Array_0[1][1] [L87] EXPR signed_char_Array_0[0][1] [L87] EXPR signed_char_Array_0[1][0] [L87] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]) [L87] EXPR signed_char_Array_0[0][1] [L87] EXPR signed_char_Array_0[1][0] [L87] EXPR (((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87-L88] return (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1588 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1588 mSDsluCounter, 6824 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4989 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2200 IncrementalHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 1835 mSDtfsCounter, 2200 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=675occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1716 NumberOfCodeBlocks, 1716 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1703 ConstructedInterpolants, 0 QuantifiedInterpolants, 4215 SizeOfPredicates, 4 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 4681/4732 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:12:17,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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 f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:12:20,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:12:20,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:12:20,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:12:20,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:12:20,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:12:20,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:12:20,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:12:20,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:12:20,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:12:20,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:12:20,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:12:20,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:12:20,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:12:20,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:12:20,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:12:20,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:12:20,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:12:20,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:12:20,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:12:20,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:12:20,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:12:20,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:12:20,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:12:20,850 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:12:20,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:12:20,850 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:12:20,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:12:20,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:12:20,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:12:20,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:12:20,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:12:20,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:12:20,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:12:20,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:12:20,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:12:20,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:12:20,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:12:20,853 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:12:20,853 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:12:20,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:12:20,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:12:20,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:12:20,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:12:20,854 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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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 -> f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a [2024-11-13 16:12:21,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:12:21,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:12:21,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:12:21,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:12:21,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:12:21,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i Unable to find full path for "g++" [2024-11-13 16:12:23,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:12:23,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:12:23,894 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2024-11-13 16:12:23,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data/7d19de102/95a9449a8f2f40b98b224ffacb0a3cdf/FLAG4cd1edc1f [2024-11-13 16:12:23,947 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/data/7d19de102/95a9449a8f2f40b98b224ffacb0a3cdf [2024-11-13 16:12:23,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:12:23,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:12:23,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:12:23,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:12:23,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:12:23,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:12:23" (1/1) ... [2024-11-13 16:12:23,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ed7e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:23, skipping insertion in model container [2024-11-13 16:12:23,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:12:23" (1/1) ... [2024-11-13 16:12:24,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:12:24,213 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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2024-11-13 16:12:24,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:12:24,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:12:24,406 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_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2024-11-13 16:12:24,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:12:24,511 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:12:24,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24 WrapperNode [2024-11-13 16:12:24,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:12:24,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:12:24,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:12:24,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:12:24,522 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:12:24" (1/1) ... [2024-11-13 16:12:24,557 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:12:24" (1/1) ... [2024-11-13 16:12:24,614 INFO L138 Inliner]: procedures = 36, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2024-11-13 16:12:24,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:12:24,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:12:24,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:12:24,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:12:24,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,697 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 52, 59, 19, 3, 17]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 4, 3, 1, 1]. The 17 writes are split as follows [0, 6, 5, 4, 1, 1]. [2024-11-13 16:12:24,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:12:24,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:12:24,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:12:24,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:12:24,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (1/1) ... [2024-11-13 16:12:24,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:12:24,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:12:24,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:24,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:12:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 16:12:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 16:12:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 16:12:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 16:12:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 16:12:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 16:12:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-13 16:12:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-13 16:12:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 16:12:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 16:12:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 16:12:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 16:12:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 16:12:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 16:12:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-13 16:12:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 16:12:24,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:12:24,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:12:24,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:12:24,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-13 16:12:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 16:12:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 16:12:25,230 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:12:25,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:12:26,451 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-13 16:12:26,451 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:12:26,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:12:26,474 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:12:26,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:12:26 BoogieIcfgContainer [2024-11-13 16:12:26,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:12:26,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:12:26,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:12:26,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:12:26,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:12:23" (1/3) ... [2024-11-13 16:12:26,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2e2e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:12:26, skipping insertion in model container [2024-11-13 16:12:26,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:12:24" (2/3) ... [2024-11-13 16:12:26,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2e2e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:12:26, skipping insertion in model container [2024-11-13 16:12:26,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:12:26" (3/3) ... [2024-11-13 16:12:26,491 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-28.i [2024-11-13 16:12:26,513 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:12:26,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-28.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:12:26,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:12:26,625 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;@5a23055a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:12:26,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:12:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:12:26,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:26,659 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1865384697, now seen corresponding path program 1 times [2024-11-13 16:12:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429252163] [2024-11-13 16:12:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:26,688 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:12:26,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:26,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:26,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:27,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 16:12:27,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-13 16:12:27,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:27,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429252163] [2024-11-13 16:12:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429252163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:12:27,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881422450] [2024-11-13 16:12:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:27,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:12:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:12:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:12:27,588 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:27,647 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-13 16:12:27,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:12:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-13 16:12:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:27,657 INFO L225 Difference]: With dead ends: 223 [2024-11-13 16:12:27,657 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 16:12:27,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:12:27,668 INFO L432 NwaCegarLoop]: 161 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, 161 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:12:27,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 16:12:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 16:12:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-13 16:12:27,723 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2024-11-13 16:12:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-13 16:12:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-13 16:12:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:12:27,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:27,728 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:27,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:27,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:27,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:27,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1727344909, now seen corresponding path program 1 times [2024-11-13 16:12:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162673861] [2024-11-13 16:12:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:27,932 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:12:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:27,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:27,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:28,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:12:28,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-13 16:12:28,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:28,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162673861] [2024-11-13 16:12:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162673861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:28,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:28,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:12:28,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281272965] [2024-11-13 16:12:28,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:12:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:12:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:28,619 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:28,723 INFO L93 Difference]: Finished difference Result 221 states and 322 transitions. [2024-11-13 16:12:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:12:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-13 16:12:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:28,727 INFO L225 Difference]: With dead ends: 221 [2024-11-13 16:12:28,727 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 16:12:28,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:28,732 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:28,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:12:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 16:12:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-13 16:12:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-13 16:12:28,761 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 128 [2024-11-13 16:12:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:28,763 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-13 16:12:28,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-13 16:12:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:12:28,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:28,769 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:28,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:28,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:28,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:28,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash -274541361, now seen corresponding path program 1 times [2024-11-13 16:12:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:28,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496061063] [2024-11-13 16:12:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:28,972 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:12:28,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:28,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:28,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:29,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:12:29,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:29,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:29,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496061063] [2024-11-13 16:12:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496061063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:12:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201130646] [2024-11-13 16:12:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:29,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:12:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:12:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:12:29,658 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:29,805 INFO L93 Difference]: Finished difference Result 230 states and 333 transitions. [2024-11-13 16:12:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:12:29,806 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-13 16:12:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:29,809 INFO L225 Difference]: With dead ends: 230 [2024-11-13 16:12:29,809 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 16:12:29,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:12:29,811 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:29,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:12:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 16:12:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-13 16:12:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-11-13 16:12:29,832 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 128 [2024-11-13 16:12:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:29,836 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-11-13 16:12:29,836 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-11-13 16:12:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:12:29,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:29,843 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:29,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:30,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1500466001, now seen corresponding path program 1 times [2024-11-13 16:12:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886765280] [2024-11-13 16:12:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:30,047 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:12:30,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:30,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:30,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:30,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:12:30,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:30,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:30,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886765280] [2024-11-13 16:12:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886765280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:12:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626699713] [2024-11-13 16:12:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:12:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:12:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:12:30,771 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:30,920 INFO L93 Difference]: Finished difference Result 238 states and 339 transitions. [2024-11-13 16:12:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:12:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-13 16:12:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:30,923 INFO L225 Difference]: With dead ends: 238 [2024-11-13 16:12:30,924 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 16:12:30,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:12:30,926 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:30,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 892 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:12:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 16:12:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-13 16:12:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.361904761904762) internal successors, (143), 105 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2024-11-13 16:12:30,939 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 128 [2024-11-13 16:12:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:30,940 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2024-11-13 16:12:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2024-11-13 16:12:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:12:30,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:30,945 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:30,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:31,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:31,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1502313043, now seen corresponding path program 1 times [2024-11-13 16:12:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063884474] [2024-11-13 16:12:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:31,148 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:12:31,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:31,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:31,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:31,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:12:31,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:31,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-13 16:12:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-13 16:12:32,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:32,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063884474] [2024-11-13 16:12:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063884474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:32,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:32,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673266103] [2024-11-13 16:12:32,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:32,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:12:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:32,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:12:32,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:12:32,028 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:33,102 INFO L93 Difference]: Finished difference Result 240 states and 340 transitions. [2024-11-13 16:12:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:12:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-13 16:12:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:33,105 INFO L225 Difference]: With dead ends: 240 [2024-11-13 16:12:33,105 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 16:12:33,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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:12:33,107 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 141 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:33,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 507 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 16:12:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 16:12:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-13 16:12:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2024-11-13 16:12:33,121 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 128 [2024-11-13 16:12:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2024-11-13 16:12:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-11-13 16:12:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:12:33,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:33,125 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:33,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:33,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 711061049, now seen corresponding path program 1 times [2024-11-13 16:12:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832923272] [2024-11-13 16:12:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:33,327 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:12:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:33,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:33,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:33,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:12:33,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:34,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-13 16:12:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-13 16:12:34,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:34,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832923272] [2024-11-13 16:12:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832923272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223262157] [2024-11-13 16:12:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:34,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:12:34,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:34,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:12:34,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:12:34,243 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:35,235 INFO L93 Difference]: Finished difference Result 240 states and 338 transitions. [2024-11-13 16:12:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:12:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-13 16:12:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:35,238 INFO L225 Difference]: With dead ends: 240 [2024-11-13 16:12:35,238 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 16:12:35,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 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:12:35,240 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 132 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:35,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 502 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 16:12:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 16:12:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-13 16:12:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-13 16:12:35,253 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 130 [2024-11-13 16:12:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:35,254 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-13 16:12:35,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:12:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-13 16:12:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:12:35,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:35,258 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:35,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:35,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:35,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:35,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -820022509, now seen corresponding path program 1 times [2024-11-13 16:12:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15640469] [2024-11-13 16:12:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:35,460 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:12:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:35,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:35,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:36,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:12:36,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:36,214 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 21 [2024-11-13 16:12:36,222 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:12:36,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 16:12:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:36,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:36,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:36,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15640469] [2024-11-13 16:12:36,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15640469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:36,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:36,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:12:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991552011] [2024-11-13 16:12:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:36,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:12:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:12:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:12:36,445 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:38,365 INFO L93 Difference]: Finished difference Result 367 states and 512 transitions. [2024-11-13 16:12:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:12:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-13 16:12:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:38,369 INFO L225 Difference]: With dead ends: 367 [2024-11-13 16:12:38,369 INFO L226 Difference]: Without dead ends: 249 [2024-11-13 16:12:38,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:12:38,371 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 252 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:38,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 861 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 16:12:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-13 16:12:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2024-11-13 16:12:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 204 states have (on average 1.338235294117647) internal successors, (273), 205 states have internal predecessors, (273), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:12:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 329 transitions. [2024-11-13 16:12:38,400 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 329 transitions. Word has length 132 [2024-11-13 16:12:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:38,401 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 329 transitions. [2024-11-13 16:12:38,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2024-11-13 16:12:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:12:38,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:38,403 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:38,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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)] Ended with exit code 0 [2024-11-13 16:12:38,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:38,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:38,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1480800081, now seen corresponding path program 1 times [2024-11-13 16:12:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98374825] [2024-11-13 16:12:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:38,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:12:38,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:38,608 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:38,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:39,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:12:39,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:39,276 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:12:39,560 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 29 [2024-11-13 16:12:40,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:40,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 18 [2024-11-13 16:12:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 223 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 16:12:40,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:12:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 16:12:41,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98374825] [2024-11-13 16:12:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98374825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:12:41,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:12:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2024-11-13 16:12:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908827543] [2024-11-13 16:12:41,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:12:41,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:12:41,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:12:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:12:41,029 INFO L87 Difference]: Start difference. First operand 236 states and 329 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-13 16:12:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:42,978 INFO L93 Difference]: Finished difference Result 362 states and 501 transitions. [2024-11-13 16:12:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:12:42,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 132 [2024-11-13 16:12:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:42,981 INFO L225 Difference]: With dead ends: 362 [2024-11-13 16:12:42,981 INFO L226 Difference]: Without dead ends: 129 [2024-11-13 16:12:42,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:12:42,982 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 234 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:42,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 581 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 16:12:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-13 16:12:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-13 16:12:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 174 transitions. [2024-11-13 16:12:42,999 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 174 transitions. Word has length 132 [2024-11-13 16:12:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:42,999 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 174 transitions. [2024-11-13 16:12:43,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-13 16:12:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 174 transitions. [2024-11-13 16:12:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:43,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:43,002 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:43,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:43,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:43,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1670254664, now seen corresponding path program 1 times [2024-11-13 16:12:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:43,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107070802] [2024-11-13 16:12:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:43,204 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:12:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:43,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:43,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:43,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:12:43,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:43,686 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 14 [2024-11-13 16:12:43,689 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:12:43,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 16:12:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:43,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:43,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107070802] [2024-11-13 16:12:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107070802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:12:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473251990] [2024-11-13 16:12:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:43,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:12:43,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:12:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:12:43,758 INFO L87 Difference]: Start difference. First operand 129 states and 174 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:43,959 INFO L93 Difference]: Finished difference Result 255 states and 345 transitions. [2024-11-13 16:12:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:12:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-13 16:12:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:43,961 INFO L225 Difference]: With dead ends: 255 [2024-11-13 16:12:43,961 INFO L226 Difference]: Without dead ends: 129 [2024-11-13 16:12:43,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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:12:43,962 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 152 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 286 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.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:43,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 286 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:12:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-13 16:12:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-13 16:12:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2024-11-13 16:12:43,984 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 134 [2024-11-13 16:12:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:43,984 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2024-11-13 16:12:43,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2024-11-13 16:12:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:43,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:43,990 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:43,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:44,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:44,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 630567926, now seen corresponding path program 1 times [2024-11-13 16:12:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738168016] [2024-11-13 16:12:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:44,192 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:12:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:44,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:44,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:44,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 16:12:44,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:44,868 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:12:45,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 16:12:45,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 65 [2024-11-13 16:12:46,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:46,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 65 [2024-11-13 16:12:48,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 56 [2024-11-13 16:12:48,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:48,112 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 148 treesize of output 58 [2024-11-13 16:12:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-13 16:12:48,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:12:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:48,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738168016] [2024-11-13 16:12:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738168016] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:12:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:12:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-13 16:12:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560595688] [2024-11-13 16:12:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:12:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:48,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:12:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:12:48,671 INFO L87 Difference]: Start difference. First operand 129 states and 173 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:49,235 INFO L93 Difference]: Finished difference Result 316 states and 426 transitions. [2024-11-13 16:12:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:12:49,237 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-13 16:12:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:49,239 INFO L225 Difference]: With dead ends: 316 [2024-11-13 16:12:49,239 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 16:12:49,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:12:49,240 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 146 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:49,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 406 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:12:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 16:12:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2024-11-13 16:12:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:12:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-11-13 16:12:49,256 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 134 [2024-11-13 16:12:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:49,257 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-11-13 16:12:49,257 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-11-13 16:12:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 16:12:49,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:49,259 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:49,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:49,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:49,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:49,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash 496554420, now seen corresponding path program 1 times [2024-11-13 16:12:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269790783] [2024-11-13 16:12:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:49,461 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:12:49,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:49,462 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:49,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:50,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:12:50,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:50,157 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 19 treesize of output 1 [2024-11-13 16:12:50,164 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 21 treesize of output 21 [2024-11-13 16:12:50,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:50,230 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 30 [2024-11-13 16:12:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:50,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:50,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269790783] [2024-11-13 16:12:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269790783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:50,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:50,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892559786] [2024-11-13 16:12:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:12:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:12:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:12:50,259 INFO L87 Difference]: Start difference. First operand 132 states and 176 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:50,961 INFO L93 Difference]: Finished difference Result 367 states and 490 transitions. [2024-11-13 16:12:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:12:50,964 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-13 16:12:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:50,966 INFO L225 Difference]: With dead ends: 367 [2024-11-13 16:12:50,966 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 16:12:50,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 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:12:50,967 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 115 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 663 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:50,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 663 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:12:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 16:12:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2024-11-13 16:12:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 198 states have (on average 1.3232323232323233) internal successors, (262), 199 states have internal predecessors, (262), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:12:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2024-11-13 16:12:50,992 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 134 [2024-11-13 16:12:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:50,992 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2024-11-13 16:12:50,993 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2024-11-13 16:12:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:12:50,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:50,995 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:51,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:51,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:51,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:51,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2114500954, now seen corresponding path program 1 times [2024-11-13 16:12:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603275267] [2024-11-13 16:12:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:51,196 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:12:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:51,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:51,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:51,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:12:51,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:12:51,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:12:51,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:12:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603275267] [2024-11-13 16:12:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603275267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:12:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:12:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:12:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742604086] [2024-11-13 16:12:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:12:51,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:12:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:12:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:12:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:12:51,656 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:12:51,720 INFO L93 Difference]: Finished difference Result 449 states and 609 transitions. [2024-11-13 16:12:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:12:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2024-11-13 16:12:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:12:51,728 INFO L225 Difference]: With dead ends: 449 [2024-11-13 16:12:51,728 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 16:12:51,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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:12:51,730 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:12:51,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:12:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 16:12:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-13 16:12:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 205 states have internal predecessors, (268), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:12:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 308 transitions. [2024-11-13 16:12:51,777 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 308 transitions. Word has length 136 [2024-11-13 16:12:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:12:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 308 transitions. [2024-11-13 16:12:51,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:12:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 308 transitions. [2024-11-13 16:12:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:12:51,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:12:51,787 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:51,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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)] Ended with exit code 0 [2024-11-13 16:12:51,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:51,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:12:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:12:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1902470579, now seen corresponding path program 1 times [2024-11-13 16:12:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:12:51,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022200228] [2024-11-13 16:12:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:51,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 16:12:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:12:51,990 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:12:51,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:23:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:23:16,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:23:16,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:23:17,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:23:17,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 54 [2024-11-13 16:23:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:23:18,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:23:18,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:23:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022200228] [2024-11-13 16:23:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022200228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:23:18,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:23:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:23:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513044622] [2024-11-13 16:23:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:23:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:23:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:23:18,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:23:18,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:23:18,924 INFO L87 Difference]: Start difference. First operand 229 states and 308 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:23:28,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:23:33,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:23:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:23:33,470 INFO L93 Difference]: Finished difference Result 455 states and 609 transitions. [2024-11-13 16:23:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:23:33,476 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2024-11-13 16:23:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:23:33,478 INFO L225 Difference]: With dead ends: 455 [2024-11-13 16:23:33,478 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 16:23:33,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:23:33,479 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 189 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:23:33,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 484 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 1 Unknown, 0 Unchecked, 11.9s Time] [2024-11-13 16:23:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 16:23:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2024-11-13 16:23:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 201 states have (on average 1.3034825870646767) internal successors, (262), 202 states have internal predecessors, (262), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:23:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 302 transitions. [2024-11-13 16:23:33,503 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 302 transitions. Word has length 136 [2024-11-13 16:23:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:23:33,504 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 302 transitions. [2024-11-13 16:23:33,504 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:23:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2024-11-13 16:23:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 16:23:33,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:23:33,506 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:33,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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)] Forceful destruction successful, exit code 0 [2024-11-13 16:23:33,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:23:33,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:23:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:23:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 10463163, now seen corresponding path program 1 times [2024-11-13 16:23:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:23:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608767525] [2024-11-13 16:23:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:23:33,712 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:23:33,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:23:33,713 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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:23:33,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6ea63fe-ec33-45c3-9536-6ded9f95ac00/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