./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.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_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:14:51,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:14:51,874 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:14:51,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:14:51,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:14:51,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:14:51,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:14:51,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:14:51,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:14:51,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:14:51,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:14:51,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:14:51,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:14:51,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:14:51,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:14:51,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:14:51,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:14:51,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:14:51,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:14:51,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:14:51,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:14:51,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:14:51,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:14:51,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:14:51,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:14:51,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:14:51,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:14:51,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:14:51,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:14:51,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:14:51,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:14:51,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:14:51,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:14:51,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:14:51,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:14:51,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:14:51,913 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_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2024-11-13 13:14:52,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:14:52,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:14:52,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:14:52,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:14:52,257 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:14:52,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i Unable to find full path for "g++" [2024-11-13 13:14:54,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:14:54,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:14:54,718 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-11-13 13:14:54,728 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data/c694593c8/ac98dd7f87124811a963191f064ac05b/FLAGf07f947ef [2024-11-13 13:14:55,013 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data/c694593c8/ac98dd7f87124811a963191f064ac05b [2024-11-13 13:14:55,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:14:55,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:14:55,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:14:55,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:14:55,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:14:55,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acd5026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55, skipping insertion in model container [2024-11-13 13:14:55,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:14:55,255 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_e83d7094-bbd6-4db5-b78a-29e40775d72e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-11-13 13:14:55,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:14:55,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:14:55,356 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_e83d7094-bbd6-4db5-b78a-29e40775d72e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-11-13 13:14:55,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:14:55,428 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:14:55,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55 WrapperNode [2024-11-13 13:14:55,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:14:55,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:14:55,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:14:55,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:14:55,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,541 INFO L138 Inliner]: procedures = 29, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2024-11-13 13:14:55,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:14:55,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:14:55,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:14:55,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:14:55,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,625 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2024-11-13 13:14:55,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:14:55,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:14:55,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:14:55,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:14:55,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (1/1) ... [2024-11-13 13:14:55,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:14:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:14:55,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:14:55,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:14:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:14:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 13:14:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 13:14:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 13:14:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 13:14:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 13:14:55,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 13:14:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:14:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:14:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:14:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 13:14:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 13:14:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 13:14:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 13:14:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 13:14:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 13:14:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 13:14:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 13:14:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 13:14:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:14:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:14:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:14:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 13:14:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 13:14:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 13:14:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 13:14:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 13:14:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 13:14:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 13:14:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 13:14:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 13:14:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:14:55,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:14:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:14:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:14:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:14:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 13:14:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 13:14:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 13:14:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:14:55,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:14:55,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:14:55,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:14:56,719 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-13 13:14:56,720 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:14:56,741 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:14:56,741 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:14:56,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:14:56 BoogieIcfgContainer [2024-11-13 13:14:56,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:14:56,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:14:56,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:14:56,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:14:56,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:14:55" (1/3) ... [2024-11-13 13:14:56,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdf9801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:14:56, skipping insertion in model container [2024-11-13 13:14:56,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:14:55" (2/3) ... [2024-11-13 13:14:56,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdf9801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:14:56, skipping insertion in model container [2024-11-13 13:14:56,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:14:56" (3/3) ... [2024-11-13 13:14:56,758 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2024-11-13 13:14:56,779 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:14:56,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-22.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:14:56,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:14:56,874 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;@6bbab767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:14:56,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:14:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:14:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 13:14:56,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:14:56,895 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:14:56,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:14:56,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:14:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -120528026, now seen corresponding path program 1 times [2024-11-13 13:14:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:14:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587821728] [2024-11-13 13:14:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:14:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:14:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:14:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:14:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:14:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:14:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:14:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:14:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:14:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:14:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:14:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:14:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:14:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587821728] [2024-11-13 13:14:57,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587821728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:14:57,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:14:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:14:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663349241] [2024-11-13 13:14:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:14:57,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:14:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:14:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:14:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:14:57,421 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:14:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:14:57,465 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-13 13:14:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:14:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-13 13:14:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:14:57,474 INFO L225 Difference]: With dead ends: 203 [2024-11-13 13:14:57,474 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 13:14:57,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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 13:14:57,481 INFO L432 NwaCegarLoop]: 146 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, 146 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 13:14:57,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:14:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 13:14:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-13 13:14:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:14:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-13 13:14:57,535 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-13 13:14:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:14:57,536 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-13 13:14:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:14:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-13 13:14:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 13:14:57,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:14:57,541 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:14:57,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:14:57,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:14:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:14:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash -476994464, now seen corresponding path program 1 times [2024-11-13 13:14:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:14:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432830635] [2024-11-13 13:14:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:14:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:14:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:14:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:14:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:14:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:14:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:14:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:14:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:14:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:14:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:14:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:14:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:14:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432830635] [2024-11-13 13:14:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432830635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:14:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:14:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:14:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044746246] [2024-11-13 13:14:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:14:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:14:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:14:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:14:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:14:58,929 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:00,621 INFO L93 Difference]: Finished difference Result 527 states and 762 transitions. [2024-11-13 13:15:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:15:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-13 13:15:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:00,628 INFO L225 Difference]: With dead ends: 527 [2024-11-13 13:15:00,632 INFO L226 Difference]: Without dead ends: 429 [2024-11-13 13:15:00,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:15:00,636 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 582 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:00,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 951 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 13:15:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-13 13:15:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 282. [2024-11-13 13:15:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 251 states have (on average 1.4183266932270917) internal successors, (356), 251 states have internal predecessors, (356), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 410 transitions. [2024-11-13 13:15:00,713 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 410 transitions. Word has length 90 [2024-11-13 13:15:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:00,714 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 410 transitions. [2024-11-13 13:15:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 410 transitions. [2024-11-13 13:15:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:15:00,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:00,721 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:15:00,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:00,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1436929837, now seen corresponding path program 1 times [2024-11-13 13:15:00,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149894949] [2024-11-13 13:15:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149894949] [2024-11-13 13:15:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149894949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:15:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255228342] [2024-11-13 13:15:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:00,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:15:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:15:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:15:00,954 INFO L87 Difference]: Start difference. First operand 282 states and 410 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:01,009 INFO L93 Difference]: Finished difference Result 579 states and 845 transitions. [2024-11-13 13:15:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:15:01,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-13 13:15:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:01,013 INFO L225 Difference]: With dead ends: 579 [2024-11-13 13:15:01,013 INFO L226 Difference]: Without dead ends: 300 [2024-11-13 13:15:01,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 13:15:01,016 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:01,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:15:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-13 13:15:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 200. [2024-11-13 13:15:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.4078212290502794) internal successors, (252), 179 states have internal predecessors, (252), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 288 transitions. [2024-11-13 13:15:01,043 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 288 transitions. Word has length 91 [2024-11-13 13:15:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:01,044 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 288 transitions. [2024-11-13 13:15:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 288 transitions. [2024-11-13 13:15:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 13:15:01,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:01,050 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:01,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:15:01,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:01,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1255803389, now seen corresponding path program 1 times [2024-11-13 13:15:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:01,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322002417] [2024-11-13 13:15:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322002417] [2024-11-13 13:15:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322002417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:01,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:01,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:15:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195095022] [2024-11-13 13:15:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:01,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:15:01,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:15:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:15:01,263 INFO L87 Difference]: Start difference. First operand 200 states and 288 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:01,371 INFO L93 Difference]: Finished difference Result 358 states and 515 transitions. [2024-11-13 13:15:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:15:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-13 13:15:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:01,375 INFO L225 Difference]: With dead ends: 358 [2024-11-13 13:15:01,375 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 13:15:01,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 13:15:01,377 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:01,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:15:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 13:15:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2024-11-13 13:15:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 126 states have (on average 1.373015873015873) internal successors, (173), 126 states have internal predecessors, (173), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 209 transitions. [2024-11-13 13:15:01,419 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 209 transitions. Word has length 92 [2024-11-13 13:15:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 209 transitions. [2024-11-13 13:15:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 209 transitions. [2024-11-13 13:15:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:15:01,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:01,426 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:01,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:15:01,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash -394735676, now seen corresponding path program 1 times [2024-11-13 13:15:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:01,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149281364] [2024-11-13 13:15:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149281364] [2024-11-13 13:15:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149281364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:15:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650243201] [2024-11-13 13:15:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:15:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:15:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:15:03,023 INFO L87 Difference]: Start difference. First operand 147 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:03,857 INFO L93 Difference]: Finished difference Result 537 states and 766 transitions. [2024-11-13 13:15:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:15:03,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-13 13:15:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:03,861 INFO L225 Difference]: With dead ends: 537 [2024-11-13 13:15:03,861 INFO L226 Difference]: Without dead ends: 440 [2024-11-13 13:15:03,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:15:03,863 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 417 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:03,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1558 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:15:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-13 13:15:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 265. [2024-11-13 13:15:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.3888888888888888) internal successors, (325), 234 states have internal predecessors, (325), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions. [2024-11-13 13:15:03,899 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 95 [2024-11-13 13:15:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:03,900 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 379 transitions. [2024-11-13 13:15:03,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions. [2024-11-13 13:15:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 13:15:03,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:03,901 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:15:03,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash -613489843, now seen corresponding path program 1 times [2024-11-13 13:15:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981580058] [2024-11-13 13:15:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:04,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981580058] [2024-11-13 13:15:04,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981580058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:04,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:04,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:15:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919984191] [2024-11-13 13:15:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:04,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:15:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:15:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:15:04,831 INFO L87 Difference]: Start difference. First operand 265 states and 379 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:05,168 INFO L93 Difference]: Finished difference Result 478 states and 684 transitions. [2024-11-13 13:15:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:15:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-13 13:15:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:05,171 INFO L225 Difference]: With dead ends: 478 [2024-11-13 13:15:05,171 INFO L226 Difference]: Without dead ends: 262 [2024-11-13 13:15:05,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:15:05,176 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 209 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:05,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 573 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:15:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-13 13:15:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-11-13 13:15:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 229 states have internal predecessors, (316), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 370 transitions. [2024-11-13 13:15:05,202 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 370 transitions. Word has length 96 [2024-11-13 13:15:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 370 transitions. [2024-11-13 13:15:05,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 370 transitions. [2024-11-13 13:15:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 13:15:05,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:05,205 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:05,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:15:05,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:05,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 579348793, now seen corresponding path program 1 times [2024-11-13 13:15:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:05,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730536047] [2024-11-13 13:15:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730536047] [2024-11-13 13:15:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730536047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:15:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113861044] [2024-11-13 13:15:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:15:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:15:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:15:05,731 INFO L87 Difference]: Start difference. First operand 260 states and 370 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:06,415 INFO L93 Difference]: Finished difference Result 693 states and 991 transitions. [2024-11-13 13:15:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:15:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-13 13:15:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:06,419 INFO L225 Difference]: With dead ends: 693 [2024-11-13 13:15:06,419 INFO L226 Difference]: Without dead ends: 482 [2024-11-13 13:15:06,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:15:06,421 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 245 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:06,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 604 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:15:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-13 13:15:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 272. [2024-11-13 13:15:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 241 states have (on average 1.3734439834024896) internal successors, (331), 241 states have internal predecessors, (331), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 385 transitions. [2024-11-13 13:15:06,474 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 385 transitions. Word has length 96 [2024-11-13 13:15:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:06,475 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 385 transitions. [2024-11-13 13:15:06,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 385 transitions. [2024-11-13 13:15:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 13:15:06,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:06,478 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:06,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:15:06,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:06,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 719897403, now seen corresponding path program 1 times [2024-11-13 13:15:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757328544] [2024-11-13 13:15:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:07,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757328544] [2024-11-13 13:15:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757328544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:15:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770553229] [2024-11-13 13:15:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:07,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:15:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:15:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:15:07,731 INFO L87 Difference]: Start difference. First operand 272 states and 385 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:15:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:09,007 INFO L93 Difference]: Finished difference Result 637 states and 906 transitions. [2024-11-13 13:15:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:15:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2024-11-13 13:15:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:09,011 INFO L225 Difference]: With dead ends: 637 [2024-11-13 13:15:09,012 INFO L226 Difference]: Without dead ends: 426 [2024-11-13 13:15:09,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:15:09,015 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 253 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:09,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 880 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:15:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-13 13:15:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 280. [2024-11-13 13:15:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3694779116465863) internal successors, (341), 249 states have internal predecessors, (341), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2024-11-13 13:15:09,063 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 96 [2024-11-13 13:15:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2024-11-13 13:15:09,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:15:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2024-11-13 13:15:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 13:15:09,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:09,065 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:09,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:15:09,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash -685768673, now seen corresponding path program 1 times [2024-11-13 13:15:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:09,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749743175] [2024-11-13 13:15:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:10,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749743175] [2024-11-13 13:15:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749743175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:10,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:15:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68097602] [2024-11-13 13:15:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:10,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:15:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:10,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:15:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:15:10,075 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:10,526 INFO L93 Difference]: Finished difference Result 418 states and 589 transitions. [2024-11-13 13:15:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:15:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-13 13:15:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:10,529 INFO L225 Difference]: With dead ends: 418 [2024-11-13 13:15:10,529 INFO L226 Difference]: Without dead ends: 321 [2024-11-13 13:15:10,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:15:10,531 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 167 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:10,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1083 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:15:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-13 13:15:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 288. [2024-11-13 13:15:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 257 states have (on average 1.3696498054474708) internal successors, (352), 257 states have internal predecessors, (352), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2024-11-13 13:15:10,558 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 97 [2024-11-13 13:15:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:10,559 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2024-11-13 13:15:10,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2024-11-13 13:15:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 13:15:10,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:10,561 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:10,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:15:10,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 206890602, now seen corresponding path program 1 times [2024-11-13 13:15:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083661647] [2024-11-13 13:15:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083661647] [2024-11-13 13:15:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083661647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:11,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:15:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009858444] [2024-11-13 13:15:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:15:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:15:11,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:15:11,267 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:11,686 INFO L93 Difference]: Finished difference Result 465 states and 655 transitions. [2024-11-13 13:15:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:15:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-13 13:15:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:11,689 INFO L225 Difference]: With dead ends: 465 [2024-11-13 13:15:11,689 INFO L226 Difference]: Without dead ends: 360 [2024-11-13 13:15:11,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:15:11,691 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 322 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:11,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 867 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:15:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-13 13:15:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 284. [2024-11-13 13:15:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 253 states have (on average 1.3636363636363635) internal successors, (345), 253 states have internal predecessors, (345), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2024-11-13 13:15:11,718 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 97 [2024-11-13 13:15:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:11,719 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2024-11-13 13:15:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2024-11-13 13:15:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 13:15:11,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:11,721 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:15:11,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1298815672, now seen corresponding path program 1 times [2024-11-13 13:15:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884896897] [2024-11-13 13:15:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 13:15:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884896897] [2024-11-13 13:15:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884896897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548102302] [2024-11-13 13:15:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:12,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:12,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:12,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:12,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:15:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:12,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:15:12,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:15:13,243 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 11 treesize of output 9 [2024-11-13 13:15:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 13:15:13,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:13,866 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 69 treesize of output 65 [2024-11-13 13:15:13,887 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2024-11-13 13:15:13,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 1 [2024-11-13 13:15:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548102302] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:15:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 10] total 20 [2024-11-13 13:15:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825063433] [2024-11-13 13:15:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:15:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:15:13,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:15:13,965 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:14,328 INFO L93 Difference]: Finished difference Result 482 states and 680 transitions. [2024-11-13 13:15:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:15:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-13 13:15:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:14,333 INFO L225 Difference]: With dead ends: 482 [2024-11-13 13:15:14,333 INFO L226 Difference]: Without dead ends: 385 [2024-11-13 13:15:14,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:15:14,338 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 122 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:14,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 727 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:15:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-13 13:15:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 306. [2024-11-13 13:15:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 275 states have (on average 1.36) internal successors, (374), 275 states have internal predecessors, (374), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 428 transitions. [2024-11-13 13:15:14,378 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 428 transitions. Word has length 97 [2024-11-13 13:15:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:14,380 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 428 transitions. [2024-11-13 13:15:14,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 428 transitions. [2024-11-13 13:15:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:15:14,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:14,385 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:14,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:15:14,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:14,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:14,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1852940595, now seen corresponding path program 1 times [2024-11-13 13:15:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:14,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194597574] [2024-11-13 13:15:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194597574] [2024-11-13 13:15:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194597574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:15:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224190292] [2024-11-13 13:15:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:15,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:15:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:15:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:15:15,152 INFO L87 Difference]: Start difference. First operand 306 states and 428 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:15:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:15,257 INFO L93 Difference]: Finished difference Result 492 states and 693 transitions. [2024-11-13 13:15:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:15:15,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-13 13:15:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:15,260 INFO L225 Difference]: With dead ends: 492 [2024-11-13 13:15:15,261 INFO L226 Difference]: Without dead ends: 373 [2024-11-13 13:15:15,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 13:15:15,262 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 156 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:15,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 629 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:15:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-13 13:15:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 304. [2024-11-13 13:15:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 273 states have (on average 1.3553113553113554) internal successors, (370), 273 states have internal predecessors, (370), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 424 transitions. [2024-11-13 13:15:15,291 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 424 transitions. Word has length 98 [2024-11-13 13:15:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:15,291 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 424 transitions. [2024-11-13 13:15:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:15:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 424 transitions. [2024-11-13 13:15:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:15:15,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:15,294 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:15:15,294 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:15,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash 47502261, now seen corresponding path program 1 times [2024-11-13 13:15:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039037686] [2024-11-13 13:15:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039037686] [2024-11-13 13:15:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039037686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:15,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:15,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:15:15,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357029668] [2024-11-13 13:15:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:15,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:15:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:15:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:15:15,554 INFO L87 Difference]: Start difference. First operand 304 states and 424 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:15,577 INFO L93 Difference]: Finished difference Result 422 states and 589 transitions. [2024-11-13 13:15:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:15:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-13 13:15:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:15,579 INFO L225 Difference]: With dead ends: 422 [2024-11-13 13:15:15,579 INFO L226 Difference]: Without dead ends: 180 [2024-11-13 13:15:15,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 13:15:15,580 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:15,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:15:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-13 13:15:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-13 13:15:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.3121019108280254) internal successors, (206), 157 states have internal predecessors, (206), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 242 transitions. [2024-11-13 13:15:15,597 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 242 transitions. Word has length 98 [2024-11-13 13:15:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:15,598 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 242 transitions. [2024-11-13 13:15:15,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2024-11-13 13:15:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 13:15:15,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:15,599 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:15,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:15:15,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:15,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash 720498042, now seen corresponding path program 1 times [2024-11-13 13:15:15,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416097226] [2024-11-13 13:15:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:15:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:15:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:15:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:15:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:15:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:15:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:15:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:15:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:15:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 13:15:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416097226] [2024-11-13 13:15:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416097226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918237260] [2024-11-13 13:15:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:16,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:16,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:16,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:16,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:15:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:17,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 13:15:17,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:17,344 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 9 treesize of output 3 [2024-11-13 13:15:18,200 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 28 treesize of output 16 [2024-11-13 13:15:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 13:15:18,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:20,122 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 60 treesize of output 44 [2024-11-13 13:15:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 13:15:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918237260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:20,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:20,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 30 [2024-11-13 13:15:20,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348673377] [2024-11-13 13:15:20,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:20,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:15:20,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:15:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2024-11-13 13:15:20,726 INFO L87 Difference]: Start difference. First operand 178 states and 242 transitions. Second operand has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-13 13:15:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:23,361 INFO L93 Difference]: Finished difference Result 403 states and 548 transitions. [2024-11-13 13:15:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 13:15:23,362 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) Word has length 99 [2024-11-13 13:15:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:23,364 INFO L225 Difference]: With dead ends: 403 [2024-11-13 13:15:23,364 INFO L226 Difference]: Without dead ends: 294 [2024-11-13 13:15:23,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=539, Invalid=1813, Unknown=0, NotChecked=0, Total=2352 [2024-11-13 13:15:23,367 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 784 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:23,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1613 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 13:15:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-13 13:15:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 192. [2024-11-13 13:15:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 169 states have internal predecessors, (219), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2024-11-13 13:15:23,391 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 99 [2024-11-13 13:15:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:23,392 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2024-11-13 13:15:23,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-13 13:15:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2024-11-13 13:15:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 13:15:23,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:23,395 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:23,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:15:23,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:23,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:23,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1309336959, now seen corresponding path program 1 times [2024-11-13 13:15:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:23,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088534978] [2024-11-13 13:15:23,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:15:23,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:15:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:15:23,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:15:23,887 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:15:23,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:15:23,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:15:23,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:23,999 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:15:24,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:15:24 BoogieIcfgContainer [2024-11-13 13:15:24,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:15:24,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:15:24,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:15:24,004 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:15:24,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:14:56" (3/4) ... [2024-11-13 13:15:24,008 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:15:24,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:15:24,013 INFO L158 Benchmark]: Toolchain (without parser) took 28995.15ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 116.8MB in the beginning and 191.1MB in the end (delta: -74.3MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2024-11-13 13:15:24,013 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:15:24,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.17ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 102.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:15:24,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.94ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 98.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:15:24,014 INFO L158 Benchmark]: Boogie Preprocessor took 117.06ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 94.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:15:24,014 INFO L158 Benchmark]: RCFGBuilder took 1076.25ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 62.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 13:15:24,015 INFO L158 Benchmark]: TraceAbstraction took 27255.98ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 61.7MB in the beginning and 191.2MB in the end (delta: -129.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-13 13:15:24,015 INFO L158 Benchmark]: Witness Printer took 8.42ms. Allocated memory is still 327.2MB. Free memory was 191.2MB in the beginning and 191.1MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:15:24,021 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.17ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 102.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.94ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 98.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 117.06ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 94.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1076.25ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 62.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27255.98ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 61.7MB in the beginning and 191.2MB in the end (delta: -129.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 8.42ms. Allocated memory is still 327.2MB. Free memory was 191.2MB in the beginning and 191.1MB in the end (delta: 66.3kB). 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 75, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of bitwiseAnd at line 57, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -5; [L38] unsigned long int last_1_unsigned_long_int_Array_0_1_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L88] EXPR signed_short_int_Array_0[0] [L88] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L89] EXPR unsigned_long_int_Array_0[1] [L89] last_1_unsigned_long_int_Array_0_1_ = unsigned_long_int_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] float_Array_0[0][0] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[1][0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[0][1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] RET updateVariables() [L101] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; [L43] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0] [L44] unsigned_short_int_Array_0[1] = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] EXPR unsigned_short_int_Array_0[1] [L50] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND TRUE unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] + -16) [L57] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND TRUE last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] unsigned_long_int_Array_0[1] = ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))) [L66] EXPR signed_short_int_Array_0[0] [L66] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1] [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[0][0] [L67] EXPR float_Array_0[0][1] [L67] float_Array_0[1][1] = (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) [L92] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 [L92] EXPR float_Array_0[1][1] [L92] EXPR float_Array_0[1][0] [L92] EXPR float_Array_0[0][0] [L92] EXPR float_Array_0[0][1] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92-L93] return ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 15, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3286 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3285 mSDsluCounter, 10434 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7903 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4106 IncrementalHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 2531 mSDtfsCounter, 4106 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 650 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=11, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1155 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 1629 NumberOfCodeBlocks, 1629 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 9852 SizeOfPredicates, 21 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 2526/2592 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 13:15:24,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:15:27,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:15:27,374 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:15:27,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:15:27,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:15:27,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:15:27,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:15:27,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:15:27,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:15:27,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:15:27,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:15:27,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:15:27,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:15:27,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:15:27,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:15:27,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:15:27,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:15:27,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:15:27,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:15:27,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:15:27,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:15:27,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:15:27,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:15:27,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:15:27,472 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_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2024-11-13 13:15:27,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:15:27,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:15:27,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:15:27,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:15:27,896 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:15:27,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i Unable to find full path for "g++" [2024-11-13 13:15:30,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:15:30,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:15:30,388 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-11-13 13:15:30,405 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data/c7c12b72a/4a8e6a448fc442b9ba7d5881c51fbb80/FLAG8b201e79b [2024-11-13 13:15:30,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/data/c7c12b72a/4a8e6a448fc442b9ba7d5881c51fbb80 [2024-11-13 13:15:30,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:15:30,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:15:30,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:15:30,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:15:30,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:15:30,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:30,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac2d65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30, skipping insertion in model container [2024-11-13 13:15:30,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:30,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:15:30,676 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_e83d7094-bbd6-4db5-b78a-29e40775d72e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-11-13 13:15:30,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:15:30,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:15:30,829 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_e83d7094-bbd6-4db5-b78a-29e40775d72e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-11-13 13:15:30,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:15:30,938 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:15:30,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30 WrapperNode [2024-11-13 13:15:30,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:15:30,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:15:30,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:15:30,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:15:30,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:30,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,018 INFO L138 Inliner]: procedures = 36, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 399 [2024-11-13 13:15:31,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:15:31,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:15:31,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:15:31,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:15:31,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,058 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2024-11-13 13:15:31,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:15:31,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:15:31,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:15:31,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:15:31,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (1/1) ... [2024-11-13 13:15:31,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:15:31,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:31,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:15:31,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:15:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:15:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 13:15:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 13:15:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 13:15:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 13:15:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 13:15:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 13:15:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 13:15:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 13:15:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 13:15:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 13:15:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 13:15:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 13:15:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 13:15:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 13:15:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-13 13:15:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:15:31,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:15:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:15:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:15:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 13:15:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 13:15:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 13:15:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 13:15:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 13:15:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 13:15:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 13:15:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 13:15:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-13 13:15:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-13 13:15:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-13 13:15:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-13 13:15:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 13:15:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 13:15:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 13:15:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 13:15:31,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 13:15:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 13:15:31,517 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:15:31,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:15:34,606 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-13 13:15:34,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:15:34,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:15:34,632 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:15:34,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:15:34 BoogieIcfgContainer [2024-11-13 13:15:34,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:15:34,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:15:34,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:15:34,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:15:34,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:15:30" (1/3) ... [2024-11-13 13:15:34,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238cc7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:15:34, skipping insertion in model container [2024-11-13 13:15:34,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:15:30" (2/3) ... [2024-11-13 13:15:34,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238cc7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:15:34, skipping insertion in model container [2024-11-13 13:15:34,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:15:34" (3/3) ... [2024-11-13 13:15:34,645 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2024-11-13 13:15:34,663 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:15:34,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-22.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:15:34,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:15:34,746 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;@45336cb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:15:34,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:15:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:15:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 13:15:34,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:34,763 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:34,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:34,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1626044618, now seen corresponding path program 1 times [2024-11-13 13:15:34,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:34,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077407707] [2024-11-13 13:15:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:34,783 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 13:15:34,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:34,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:34,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:35,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:15:35,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 13:15:35,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:15:35,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077407707] [2024-11-13 13:15:35,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077407707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:35,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:35,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:15:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365951682] [2024-11-13 13:15:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:35,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:15:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:15:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:15:35,480 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:15:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:35,511 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-13 13:15:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:15:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-13 13:15:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:35,520 INFO L225 Difference]: With dead ends: 188 [2024-11-13 13:15:35,521 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 13:15:35,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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 13:15:35,528 INFO L432 NwaCegarLoop]: 129 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, 129 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 13:15:35,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:15:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 13:15:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 13:15:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:15:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-13 13:15:35,575 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-13 13:15:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:35,575 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-13 13:15:35,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:15:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-13 13:15:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 13:15:35,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:35,580 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:35,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:35,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:35,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:35,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 106342469, now seen corresponding path program 1 times [2024-11-13 13:15:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684179452] [2024-11-13 13:15:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:35,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:15:35,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:35,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:35,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:36,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:15:36,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:37,623 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 15 [2024-11-13 13:15:37,716 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 47 treesize of output 35 [2024-11-13 13:15:37,977 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 84 treesize of output 60 [2024-11-13 13:15:37,987 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 63 treesize of output 51 [2024-11-13 13:15:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:38,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:15:38,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:38,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684179452] [2024-11-13 13:15:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684179452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:38,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:38,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:15:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146043019] [2024-11-13 13:15:38,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:38,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:15:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:15:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:15:38,068 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:40,006 INFO L93 Difference]: Finished difference Result 493 states and 694 transitions. [2024-11-13 13:15:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:15:40,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-13 13:15:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:40,015 INFO L225 Difference]: With dead ends: 493 [2024-11-13 13:15:40,019 INFO L226 Difference]: Without dead ends: 404 [2024-11-13 13:15:40,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:15:40,022 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 475 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:40,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1313 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 13:15:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-13 13:15:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 351. [2024-11-13 13:15:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 310 states have (on average 1.3806451612903226) internal successors, (428), 310 states have internal predecessors, (428), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 13:15:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 500 transitions. [2024-11-13 13:15:40,125 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 500 transitions. Word has length 92 [2024-11-13 13:15:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:40,127 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 500 transitions. [2024-11-13 13:15:40,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 500 transitions. [2024-11-13 13:15:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 13:15:40,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:40,135 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:40,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:40,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:40,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:40,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1474490940, now seen corresponding path program 1 times [2024-11-13 13:15:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:40,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397807400] [2024-11-13 13:15:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:40,338 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 13:15:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:40,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:40,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:40,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:15:40,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:40,924 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 17 treesize of output 9 [2024-11-13 13:15:41,218 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 16 treesize of output 12 [2024-11-13 13:15:41,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-13 13:15:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:41,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:15:41,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397807400] [2024-11-13 13:15:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397807400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:41,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:41,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:15:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457917637] [2024-11-13 13:15:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:41,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:15:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:15:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:15:41,307 INFO L87 Difference]: Start difference. First operand 351 states and 500 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:42,299 INFO L93 Difference]: Finished difference Result 709 states and 999 transitions. [2024-11-13 13:15:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:15:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-13 13:15:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:42,302 INFO L225 Difference]: With dead ends: 709 [2024-11-13 13:15:42,303 INFO L226 Difference]: Without dead ends: 361 [2024-11-13 13:15:42,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:15:42,310 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 405 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:42,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1013 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:15:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-13 13:15:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 265. [2024-11-13 13:15:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.3717948717948718) internal successors, (321), 234 states have internal predecessors, (321), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 375 transitions. [2024-11-13 13:15:42,356 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 375 transitions. Word has length 93 [2024-11-13 13:15:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:42,358 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 375 transitions. [2024-11-13 13:15:42,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 375 transitions. [2024-11-13 13:15:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 13:15:42,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:42,365 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:42,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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)] Forceful destruction successful, exit code 0 [2024-11-13 13:15:42,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:42,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:42,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash -605459240, now seen corresponding path program 1 times [2024-11-13 13:15:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:42,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401761499] [2024-11-13 13:15:42,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:42,568 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 13:15:42,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:42,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:42,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:43,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:15:43,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:43,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:15:43,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:43,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401761499] [2024-11-13 13:15:43,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401761499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:43,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:15:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481061776] [2024-11-13 13:15:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:15:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:15:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:15:43,150 INFO L87 Difference]: Start difference. First operand 265 states and 375 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:43,215 INFO L93 Difference]: Finished difference Result 541 states and 767 transitions. [2024-11-13 13:15:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:15:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-13 13:15:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:43,219 INFO L225 Difference]: With dead ends: 541 [2024-11-13 13:15:43,219 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 13:15:43,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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 13:15:43,224 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:43,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 248 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:15:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 13:15:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2024-11-13 13:15:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions. [2024-11-13 13:15:43,261 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 93 [2024-11-13 13:15:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:43,263 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions. [2024-11-13 13:15:43,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2024-11-13 13:15:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:15:43,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:43,268 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:43,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:43,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:43,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:43,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2077317152, now seen corresponding path program 1 times [2024-11-13 13:15:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:43,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670066823] [2024-11-13 13:15:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:43,471 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 13:15:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:43,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:43,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:43,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:15:44,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:44,040 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 17 treesize of output 9 [2024-11-13 13:15:44,322 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 13:15:44,561 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 51 treesize of output 33 [2024-11-13 13:15:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:44,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:15:44,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670066823] [2024-11-13 13:15:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670066823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:15:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658100589] [2024-11-13 13:15:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:44,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:15:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:15:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:15:44,641 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:45,612 INFO L93 Difference]: Finished difference Result 363 states and 502 transitions. [2024-11-13 13:15:45,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:15:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-13 13:15:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:45,615 INFO L225 Difference]: With dead ends: 363 [2024-11-13 13:15:45,615 INFO L226 Difference]: Without dead ends: 274 [2024-11-13 13:15:45,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:15:45,618 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 238 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:45,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 919 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:15:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-13 13:15:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 203. [2024-11-13 13:15:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2024-11-13 13:15:45,643 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 94 [2024-11-13 13:15:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:45,644 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2024-11-13 13:15:45,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2024-11-13 13:15:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 13:15:45,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:45,648 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:45,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:45,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:45,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1184657877, now seen corresponding path program 1 times [2024-11-13 13:15:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580139587] [2024-11-13 13:15:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:45,851 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 13:15:45,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:45,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:45,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:46,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:15:46,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:46,352 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 17 treesize of output 9 [2024-11-13 13:15:46,602 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 16 treesize of output 12 [2024-11-13 13:15:46,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-13 13:15:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:15:46,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:15:46,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580139587] [2024-11-13 13:15:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580139587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:15:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844434175] [2024-11-13 13:15:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:46,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:15:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:15:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:15:46,704 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:47,440 INFO L93 Difference]: Finished difference Result 410 states and 568 transitions. [2024-11-13 13:15:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:15:47,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-13 13:15:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:47,444 INFO L225 Difference]: With dead ends: 410 [2024-11-13 13:15:47,444 INFO L226 Difference]: Without dead ends: 313 [2024-11-13 13:15:47,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:15:47,446 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 328 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:47,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 949 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:15:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-13 13:15:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 199. [2024-11-13 13:15:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.353932584269663) internal successors, (241), 178 states have internal predecessors, (241), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:15:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 277 transitions. [2024-11-13 13:15:47,471 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 277 transitions. Word has length 94 [2024-11-13 13:15:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 277 transitions. [2024-11-13 13:15:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:15:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 277 transitions. [2024-11-13 13:15:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:15:47,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:47,475 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:47,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:47,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:47,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:47,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1377840627, now seen corresponding path program 1 times [2024-11-13 13:15:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89256303] [2024-11-13 13:15:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:47,676 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 13:15:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:47,678 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:47,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:48,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:15:48,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:48,553 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 18 treesize of output 10 [2024-11-13 13:15:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-13 13:15:48,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:49,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:15:49,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89256303] [2024-11-13 13:15:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89256303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113507465] [2024-11-13 13:15:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:49,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:49,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:15:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:49,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:15:49,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:49,907 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 18 treesize of output 10 [2024-11-13 13:15:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-13 13:15:49,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:50,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:15:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113507465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:50,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:15:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-13 13:15:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612575819] [2024-11-13 13:15:50,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:50,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:15:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:15:50,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:15:50,219 INFO L87 Difference]: Start difference. First operand 199 states and 277 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 13:15:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:51,622 INFO L93 Difference]: Finished difference Result 552 states and 764 transitions. [2024-11-13 13:15:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:15:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 95 [2024-11-13 13:15:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:51,626 INFO L225 Difference]: With dead ends: 552 [2024-11-13 13:15:51,626 INFO L226 Difference]: Without dead ends: 356 [2024-11-13 13:15:51,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:15:51,628 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:51,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 551 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:15:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-13 13:15:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 246. [2024-11-13 13:15:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.341121495327103) internal successors, (287), 214 states have internal predecessors, (287), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 341 transitions. [2024-11-13 13:15:51,664 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 341 transitions. Word has length 95 [2024-11-13 13:15:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:51,665 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 341 transitions. [2024-11-13 13:15:51,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 13:15:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2024-11-13 13:15:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:15:51,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:51,668 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:51,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:51,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:15:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:52,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:52,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1243827121, now seen corresponding path program 1 times [2024-11-13 13:15:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:52,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878256092] [2024-11-13 13:15:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:52,071 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 13:15:52,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:52,075 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:52,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:52,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:15:52,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:52,508 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 9 treesize of output 3 [2024-11-13 13:15:53,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 13:15:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 13:15:53,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:54,269 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 39 treesize of output 27 [2024-11-13 13:15:54,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878256092] [2024-11-13 13:15:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878256092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856511252] [2024-11-13 13:15:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:54,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:54,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:54,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:15:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:54,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 13:15:54,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:54,713 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 9 treesize of output 3 [2024-11-13 13:15:55,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 13:15:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 13:15:55,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:55,918 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 39 treesize of output 27 [2024-11-13 13:15:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856511252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:56,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:15:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-13 13:15:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473899039] [2024-11-13 13:15:56,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:56,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:15:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:15:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:15:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:15:56,006 INFO L87 Difference]: Start difference. First operand 246 states and 341 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 13:15:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:57,117 INFO L93 Difference]: Finished difference Result 562 states and 775 transitions. [2024-11-13 13:15:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:15:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 95 [2024-11-13 13:15:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:57,121 INFO L225 Difference]: With dead ends: 562 [2024-11-13 13:15:57,121 INFO L226 Difference]: Without dead ends: 366 [2024-11-13 13:15:57,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:15:57,125 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 233 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:57,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 719 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:15:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-13 13:15:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 271. [2024-11-13 13:15:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.3277310924369747) internal successors, (316), 238 states have internal predecessors, (316), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:15:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 370 transitions. [2024-11-13 13:15:57,163 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 370 transitions. Word has length 95 [2024-11-13 13:15:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:57,163 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 370 transitions. [2024-11-13 13:15:57,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 13:15:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 370 transitions. [2024-11-13 13:15:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 13:15:57,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:57,165 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:57,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:15:57,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:57,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:57,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:15:57,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash -750317585, now seen corresponding path program 1 times [2024-11-13 13:15:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:15:57,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427722205] [2024-11-13 13:15:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:57,567 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 13:15:57,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:15:57,569 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:57,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:15:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:58,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:15:58,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:58,034 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 9 treesize of output 3 [2024-11-13 13:15:58,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 13:15:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 13:15:58,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:58,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:15:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427722205] [2024-11-13 13:15:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427722205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185764691] [2024-11-13 13:15:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:58,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:58,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:58,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:58,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:15:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:59,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 13:15:59,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:59,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-13 13:15:59,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:59,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2024-11-13 13:15:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-13 13:15:59,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:16:00,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-13 13:16:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 13:16:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185764691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:16:00,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:16:00,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2024-11-13 13:16:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183160379] [2024-11-13 13:16:00,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:16:00,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:16:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:16:00,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:16:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:16:00,565 INFO L87 Difference]: Start difference. First operand 271 states and 370 transitions. Second operand has 19 states, 16 states have (on average 7.375) internal successors, (118), 19 states have internal predecessors, (118), 8 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-13 13:16:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:16:04,506 INFO L93 Difference]: Finished difference Result 632 states and 868 transitions. [2024-11-13 13:16:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 13:16:04,507 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 19 states have internal predecessors, (118), 8 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 8 states have call successors, (22) Word has length 95 [2024-11-13 13:16:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:16:04,509 INFO L225 Difference]: With dead ends: 632 [2024-11-13 13:16:04,509 INFO L226 Difference]: Without dead ends: 436 [2024-11-13 13:16:04,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2024-11-13 13:16:04,511 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 542 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:16:04,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 923 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 13:16:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-13 13:16:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 426. [2024-11-13 13:16:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 376 states have (on average 1.321808510638298) internal successors, (497), 378 states have internal predecessors, (497), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-13 13:16:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 579 transitions. [2024-11-13 13:16:04,544 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 579 transitions. Word has length 95 [2024-11-13 13:16:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:16:04,548 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 579 transitions. [2024-11-13 13:16:04,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 19 states have internal predecessors, (118), 8 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-13 13:16:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 579 transitions. [2024-11-13 13:16:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 13:16:04,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:16:04,553 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:04,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:16:04,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:16:04,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:16:04,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:16:04,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash 439399030, now seen corresponding path program 1 times [2024-11-13 13:16:04,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:16:04,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352986191] [2024-11-13 13:16:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:04,955 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 13:16:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:16:04,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:16:04,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:16:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:05,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:16:05,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:16:05,434 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 23 treesize of output 19 [2024-11-13 13:16:05,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2024-11-13 13:16:05,528 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 54 treesize of output 42 [2024-11-13 13:16:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:16:05,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:16:05,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:16:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352986191] [2024-11-13 13:16:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352986191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:16:05,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:16:05,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:16:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008654642] [2024-11-13 13:16:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:16:05,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:16:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:16:05,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:16:05,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:16:05,568 INFO L87 Difference]: Start difference. First operand 426 states and 579 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:16:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:16:06,000 INFO L93 Difference]: Finished difference Result 731 states and 1005 transitions. [2024-11-13 13:16:06,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:16:06,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-13 13:16:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:16:06,006 INFO L225 Difference]: With dead ends: 731 [2024-11-13 13:16:06,007 INFO L226 Difference]: Without dead ends: 590 [2024-11-13 13:16:06,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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 13:16:06,008 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 107 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:16:06,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 585 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:16:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-13 13:16:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 454. [2024-11-13 13:16:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 404 states have (on average 1.316831683168317) internal successors, (532), 406 states have internal predecessors, (532), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-13 13:16:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 614 transitions. [2024-11-13 13:16:06,049 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 614 transitions. Word has length 97 [2024-11-13 13:16:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:16:06,050 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 614 transitions. [2024-11-13 13:16:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:16:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 614 transitions. [2024-11-13 13:16:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 13:16:06,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:16:06,052 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:16:06,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-13 13:16:06,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:16:06,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:16:06,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1628093376, now seen corresponding path program 1 times [2024-11-13 13:16:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:16:06,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891683954] [2024-11-13 13:16:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:06,255 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 13:16:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:16:06,258 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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 13:16:06,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e83d7094-bbd6-4db5-b78a-29e40775d72e/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