./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB --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 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:13:41,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:13:41,606 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:13:41,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:13:41,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:13:41,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:13:41,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:13:41,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:13:41,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:13:41,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:13:41,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:13:41,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:13:41,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:13:41,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:13:41,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:13:41,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:13:41,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:13:41,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:13:41,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:13:41,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:13:41,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:13:41,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:41,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:41,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:41,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:41,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:13:41,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:41,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:13:41,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:13:41,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:13:41,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:13:41,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:13:41,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:13:41,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:13:41,644 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_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 [2024-11-27 20:13:41,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:13:41,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:13:41,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:13:41,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:13:41,973 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:13:41,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2024-11-27 20:13:45,115 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/cd6aff3a8/7c6c4705f1a34dccb5247ca1ff02dc47/FLAG45858795d [2024-11-27 20:13:45,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:13:45,384 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2024-11-27 20:13:45,394 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/cd6aff3a8/7c6c4705f1a34dccb5247ca1ff02dc47/FLAG45858795d [2024-11-27 20:13:45,417 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/cd6aff3a8/7c6c4705f1a34dccb5247ca1ff02dc47 [2024-11-27 20:13:45,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:13:45,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:13:45,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:45,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:13:45,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:13:45,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4382b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45, skipping insertion in model container [2024-11-27 20:13:45,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:13:45,617 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_787703a8-e32f-4f8e-8b69-c3d55e02d998/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-11-27 20:13:45,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:45,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:13:45,708 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_787703a8-e32f-4f8e-8b69-c3d55e02d998/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-11-27 20:13:45,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:45,797 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:13:45,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45 WrapperNode [2024-11-27 20:13:45,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:45,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:45,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:13:45,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:13:45,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,871 INFO L138 Inliner]: procedures = 29, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2024-11-27 20:13:45,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:45,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:13:45,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:13:45,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:13:45,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,937 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2024-11-27 20:13:45,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:45,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:13:45,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:13:45,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:13:45,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:13:45,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (1/1) ... [2024-11-27 20:13:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:46,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:13:46,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:13:46,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:13:46,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:13:46,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:13:46,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:13:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-27 20:13:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-27 20:13:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-27 20:13:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-27 20:13:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-27 20:13:46,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-27 20:13:46,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-27 20:13:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 20:13:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 20:13:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:13:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:13:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:13:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-27 20:13:46,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:13:46,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:13:46,288 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:13:46,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:13:47,107 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-27 20:13:47,108 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:13:47,127 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:13:47,129 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 20:13:47,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:47 BoogieIcfgContainer [2024-11-27 20:13:47,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:13:47,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:13:47,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:13:47,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:13:47,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:13:45" (1/3) ... [2024-11-27 20:13:47,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3a6d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:47, skipping insertion in model container [2024-11-27 20:13:47,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:45" (2/3) ... [2024-11-27 20:13:47,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3a6d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:47, skipping insertion in model container [2024-11-27 20:13:47,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:47" (3/3) ... [2024-11-27 20:13:47,145 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2024-11-27 20:13:47,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:13:47,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-74.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:13:47,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:13:47,272 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;@455337ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:13:47,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:13:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:13:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:13:47,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:47,297 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:13:47,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:47,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1858374721, now seen corresponding path program 1 times [2024-11-27 20:13:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:47,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853314787] [2024-11-27 20:13:47,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-27 20:13:47,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:47,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853314787] [2024-11-27 20:13:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853314787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852490156] [2024-11-27 20:13:47,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:47,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:47,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:47,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:13:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:48,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:13:48,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-27 20:13:48,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:13:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852490156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:13:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 20:13:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52955010] [2024-11-27 20:13:48,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:48,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:13:48,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:48,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:13:48,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:13:48,265 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:13:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:48,341 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2024-11-27 20:13:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:13:48,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-27 20:13:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:48,353 INFO L225 Difference]: With dead ends: 243 [2024-11-27 20:13:48,353 INFO L226 Difference]: Without dead ends: 121 [2024-11-27 20:13:48,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-27 20:13:48,362 INFO L435 NwaCegarLoop]: 178 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, 178 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-27 20:13:48,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-27 20:13:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-27 20:13:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:13:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-11-27 20:13:48,405 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2024-11-27 20:13:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:48,406 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-11-27 20:13:48,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:13:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-11-27 20:13:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:13:48,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:48,409 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:13:48,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:13:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-27 20:13:48,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1041807627, now seen corresponding path program 1 times [2024-11-27 20:13:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584025798] [2024-11-27 20:13:48,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:13:49,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584025798] [2024-11-27 20:13:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584025798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:49,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:49,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356721595] [2024-11-27 20:13:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:49,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:49,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:49,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:49,029 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:13:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:49,081 INFO L93 Difference]: Finished difference Result 241 states and 356 transitions. [2024-11-27 20:13:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:49,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-27 20:13:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:49,083 INFO L225 Difference]: With dead ends: 241 [2024-11-27 20:13:49,084 INFO L226 Difference]: Without dead ends: 123 [2024-11-27 20:13:49,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:49,085 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:49,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-27 20:13:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-27 20:13:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:13:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-27 20:13:49,103 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 150 [2024-11-27 20:13:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:49,105 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-27 20:13:49,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:13:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-27 20:13:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:13:49,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:49,119 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:13:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:13:49,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 991586419, now seen corresponding path program 1 times [2024-11-27 20:13:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075534740] [2024-11-27 20:13:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:13:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075534740] [2024-11-27 20:13:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075534740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:50,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:50,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450281599] [2024-11-27 20:13:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:50,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:50,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:50,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:50,036 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:13:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:50,307 INFO L93 Difference]: Finished difference Result 321 states and 475 transitions. [2024-11-27 20:13:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:50,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-27 20:13:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:50,310 INFO L225 Difference]: With dead ends: 321 [2024-11-27 20:13:50,314 INFO L226 Difference]: Without dead ends: 201 [2024-11-27 20:13:50,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:50,315 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 79 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:50,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 485 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-27 20:13:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 124. [2024-11-27 20:13:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:13:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-27 20:13:50,333 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 150 [2024-11-27 20:13:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:50,334 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-27 20:13:50,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:13:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-27 20:13:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:13:50,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:50,337 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:13:50,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:13:50,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:50,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1132135029, now seen corresponding path program 1 times [2024-11-27 20:13:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961135927] [2024-11-27 20:13:50,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:13:52,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:52,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961135927] [2024-11-27 20:13:52,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961135927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:52,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:52,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:13:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200600501] [2024-11-27 20:13:52,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:52,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:13:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:52,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:13:52,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:13:52,606 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:13:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:53,139 INFO L93 Difference]: Finished difference Result 344 states and 502 transitions. [2024-11-27 20:13:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:13:53,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-27 20:13:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:53,143 INFO L225 Difference]: With dead ends: 344 [2024-11-27 20:13:53,143 INFO L226 Difference]: Without dead ends: 223 [2024-11-27 20:13:53,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:13:53,145 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 131 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:53,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1550 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:13:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-27 20:13:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2024-11-27 20:13:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 186 states have internal predecessors, (257), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-27 20:13:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 321 transitions. [2024-11-27 20:13:53,173 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 321 transitions. Word has length 150 [2024-11-27 20:13:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:53,174 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 321 transitions. [2024-11-27 20:13:53,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:13:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 321 transitions. [2024-11-27 20:13:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:13:53,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:53,178 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:13:53,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:13:53,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash 739108019, now seen corresponding path program 1 times [2024-11-27 20:13:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395985372] [2024-11-27 20:13:53,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:13:53,398 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:13:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:13:53,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:13:53,634 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:13:53,635 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:13:53,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:13:53,641 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-27 20:13:53,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:13:53,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:13:53 BoogieIcfgContainer [2024-11-27 20:13:53,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:13:53,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:13:53,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:13:53,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:13:53,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:47" (3/4) ... [2024-11-27 20:13:53,744 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:13:53,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:13:53,746 INFO L158 Benchmark]: Toolchain (without parser) took 8322.89ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 92.4MB in the beginning and 54.1MB in the end (delta: 38.3MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2024-11-27 20:13:53,746 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:13:53,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.47ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 76.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:13:53,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.08ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 72.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:13:53,747 INFO L158 Benchmark]: Boogie Preprocessor took 123.88ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 68.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:13:53,748 INFO L158 Benchmark]: RCFGBuilder took 1133.53ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 86.4MB in the end (delta: -18.1MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-27 20:13:53,748 INFO L158 Benchmark]: TraceAbstraction took 6606.88ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 85.9MB in the beginning and 55.6MB in the end (delta: 30.2MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2024-11-27 20:13:53,748 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 184.5MB. Free memory was 55.6MB in the beginning and 54.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:13:53,751 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.44ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.47ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 76.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.08ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 72.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 123.88ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 68.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1133.53ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 86.4MB in the end (delta: -18.1MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6606.88ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 85.9MB in the beginning and 55.6MB in the end (delta: 30.2MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 184.5MB. Free memory was 55.6MB in the beginning and 54.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_1__0_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L103] isInitial = 1 [L104] FCALL initially() [L106] CALL updateLastVariables() [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] last_1_BOOL_unsigned_char_Array_0_1__0_ = BOOL_unsigned_char_Array_0[1][0] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L66] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L69] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L72] double_Array_0[0] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[0] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L73] EXPR double_Array_0[0] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L76] double_Array_0[2] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L80] double_Array_0[4] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L91] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L92] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L107] RET updateVariables() [L108] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_; [L36] EXPR double_Array_0[1] [L36] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L36] COND TRUE (double_Array_0[1] > double_Array_0[0]) || stepLocal_0 [L37] EXPR BOOL_unsigned_char_Array_0[0][1] [L37] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[0][1] [L41] EXPR BOOL_unsigned_char_Array_0[0][0] [L41] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[0][0]; [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0][0]) [L49] EXPR BOOL_unsigned_char_Array_0[1][1] [L49] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L51] EXPR double_Array_0[4] [L51] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L51] EXPR double_Array_0[4] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L51] EXPR double_Array_0[2] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) [L54] EXPR double_Array_0[4] [L54] EXPR double_Array_0[3] [L54] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L54] COND FALSE !(double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) [L61] EXPR unsigned_long_int_Array_0[3] [L61] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[3] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR double_Array_0[4] [L99] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L99] EXPR double_Array_0[4] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L99] EXPR double_Array_0[2] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) [L99] EXPR unsigned_long_int_Array_0[4] [L99] EXPR unsigned_long_int_Array_0[3] [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99-L100] return (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 2730 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1937 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 793 mSDtfsCounter, 329 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 80 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2688/2720 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:13:53,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/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_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB --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 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:13:57,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:13:57,292 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 20:13:57,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:13:57,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:13:57,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:13:57,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:13:57,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:13:57,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:13:57,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:13:57,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:13:57,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:13:57,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:13:57,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:13:57,383 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:13:57,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:13:57,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:13:57,383 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:13:57,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:13:57,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:13:57,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:13:57,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:13:57,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:57,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:57,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:57,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:57,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:13:57,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:57,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:57,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:57,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:57,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:13:57,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:13:57,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:13:57,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:13:57,390 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:13:57,390 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:13:57,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:13:57,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:13:57,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:13:57,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:13:57,391 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_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 [2024-11-27 20:13:57,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:13:57,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:13:57,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:13:57,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:13:57,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:13:57,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2024-11-27 20:14:01,306 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/fc1dca0ac/90483f9bdac445178cd1e3313f762953/FLAGcf108f839 [2024-11-27 20:14:01,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:14:01,757 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2024-11-27 20:14:01,778 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/fc1dca0ac/90483f9bdac445178cd1e3313f762953/FLAGcf108f839 [2024-11-27 20:14:01,921 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/data/fc1dca0ac/90483f9bdac445178cd1e3313f762953 [2024-11-27 20:14:01,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:14:01,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:14:01,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:01,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:14:01,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:14:01,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:01" (1/1) ... [2024-11-27 20:14:01,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536630b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:01, skipping insertion in model container [2024-11-27 20:14:01,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:01" (1/1) ... [2024-11-27 20:14:01,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:02,198 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_787703a8-e32f-4f8e-8b69-c3d55e02d998/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-11-27 20:14:02,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:02,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:14:02,324 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_787703a8-e32f-4f8e-8b69-c3d55e02d998/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-11-27 20:14:02,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:02,455 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:14:02,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02 WrapperNode [2024-11-27 20:14:02,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:02,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:02,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:14:02,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:14:02,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,557 INFO L138 Inliner]: procedures = 33, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2024-11-27 20:14:02,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:02,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:14:02,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:14:02,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:14:02,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,606 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2024-11-27 20:14:02,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:14:02,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:14:02,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:14:02,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:14:02,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (1/1) ... [2024-11-27 20:14:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:02,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:02,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:14:02,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:14:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:14:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-27 20:14:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-27 20:14:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-27 20:14:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 20:14:02,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 20:14:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:14:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:14:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-27 20:14:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-27 20:14:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-27 20:14:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-27 20:14:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:14:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:14:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:14:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-27 20:14:02,994 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:14:02,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:14:06,753 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-27 20:14:06,754 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:14:06,768 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:14:06,770 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 20:14:06,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:06 BoogieIcfgContainer [2024-11-27 20:14:06,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:14:06,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:14:06,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:14:06,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:14:06,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:14:01" (1/3) ... [2024-11-27 20:14:06,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa158a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:06, skipping insertion in model container [2024-11-27 20:14:06,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:02" (2/3) ... [2024-11-27 20:14:06,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa158a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:06, skipping insertion in model container [2024-11-27 20:14:06,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:06" (3/3) ... [2024-11-27 20:14:06,784 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2024-11-27 20:14:06,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:14:06,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-74.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:14:06,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:14:06,910 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;@20051401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:14:06,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:14:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:14:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:14:06,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:06,938 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:14:06,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:06,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1858374721, now seen corresponding path program 1 times [2024-11-27 20:14:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:06,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871358910] [2024-11-27 20:14:06,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:06,971 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-27 20:14:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:14:06,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:06,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:07,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:14:07,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-27 20:14:07,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:07,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871358910] [2024-11-27 20:14:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871358910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:14:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768163077] [2024-11-27 20:14:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:14:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:07,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:14:07,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:14:07,907 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:14:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:07,954 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2024-11-27 20:14:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:14:07,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-27 20:14:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:07,967 INFO L225 Difference]: With dead ends: 243 [2024-11-27 20:14:07,967 INFO L226 Difference]: Without dead ends: 121 [2024-11-27 20:14:07,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-27 20:14:07,976 INFO L435 NwaCegarLoop]: 178 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, 178 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-27 20:14:07,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-27 20:14:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-27 20:14:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:14:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-11-27 20:14:08,037 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2024-11-27 20:14:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:08,038 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-11-27 20:14:08,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:14:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-11-27 20:14:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:14:08,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:08,043 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:14:08,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:08,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:08,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:08,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1041807627, now seen corresponding path program 1 times [2024-11-27 20:14:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:08,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675280738] [2024-11-27 20:14:08,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:08,248 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-27 20:14:08,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:14:08,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:08,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:08,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:14:08,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-27 20:14:09,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:09,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675280738] [2024-11-27 20:14:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675280738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290236199] [2024-11-27 20:14:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:09,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:09,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:09,012 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:14:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:09,147 INFO L93 Difference]: Finished difference Result 241 states and 356 transitions. [2024-11-27 20:14:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:14:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-27 20:14:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:09,159 INFO L225 Difference]: With dead ends: 241 [2024-11-27 20:14:09,159 INFO L226 Difference]: Without dead ends: 123 [2024-11-27 20:14:09,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:09,164 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:09,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:14:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-27 20:14:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-27 20:14:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:14:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-27 20:14:09,181 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 150 [2024-11-27 20:14:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:09,184 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-27 20:14:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:14:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-27 20:14:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:14:09,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:09,188 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:14:09,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:09,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:09,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash 991586419, now seen corresponding path program 1 times [2024-11-27 20:14:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888593641] [2024-11-27 20:14:09,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:09,391 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-27 20:14:09,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:14:09,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:09,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:10,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:14:10,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:14:10,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:10,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888593641] [2024-11-27 20:14:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888593641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:10,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:10,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:10,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965122779] [2024-11-27 20:14:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:10,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:10,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:10,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:10,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:10,289 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:14:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:10,553 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-27 20:14:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:14:10,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-27 20:14:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:10,556 INFO L225 Difference]: With dead ends: 244 [2024-11-27 20:14:10,557 INFO L226 Difference]: Without dead ends: 124 [2024-11-27 20:14:10,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:10,559 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:10,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-27 20:14:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-27 20:14:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-27 20:14:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-27 20:14:10,572 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 150 [2024-11-27 20:14:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:10,573 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-27 20:14:10,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:14:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-27 20:14:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:14:10,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:10,582 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:14:10,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-27 20:14:10,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:10,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:10,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1132135029, now seen corresponding path program 1 times [2024-11-27 20:14:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534089926] [2024-11-27 20:14:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:10,787 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-27 20:14:10,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:14:10,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:10,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:14:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:11,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-27 20:14:11,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:58,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:14:58,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 665 treesize of output 197 [2024-11-27 20:15:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-27 20:15:09,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:09,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534089926] [2024-11-27 20:15:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534089926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:09,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-27 20:15:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229783647] [2024-11-27 20:15:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 20:15:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:09,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 20:15:09,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:15:09,405 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:16:13,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:16:36,571 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 80 DAG size of output: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:17:19,902 WARN L286 SmtUtils]: Spent 29.17s on a formula simplification. DAG size of input: 123 DAG size of output: 118 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:17:24,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:17:27,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:17:29,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:17:31,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:17:32,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:17:49,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:17:53,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:18:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:21,973 INFO L93 Difference]: Finished difference Result 417 states and 607 transitions. [2024-11-27 20:18:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 20:18:21,975 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-27 20:18:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:21,978 INFO L225 Difference]: With dead ends: 417 [2024-11-27 20:18:21,978 INFO L226 Difference]: Without dead ends: 296 [2024-11-27 20:18:21,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 106.4s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-27 20:18:21,980 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 363 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:21,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1721 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1368 Invalid, 1 Unknown, 0 Unchecked, 122.4s Time] [2024-11-27 20:18:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-27 20:18:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2024-11-27 20:18:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 248 states have (on average 1.3991935483870968) internal successors, (347), 250 states have internal predecessors, (347), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-27 20:18:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 423 transitions. [2024-11-27 20:18:22,019 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 423 transitions. Word has length 150 [2024-11-27 20:18:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:22,020 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 423 transitions. [2024-11-27 20:18:22,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:18:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 423 transitions. [2024-11-27 20:18:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:18:22,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:22,023 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:18:22,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:22,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:22,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:18:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -252301444, now seen corresponding path program 1 times [2024-11-27 20:18:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898578130] [2024-11-27 20:18:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:22,226 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-27 20:18:22,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:18:22,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:22,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:22,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:18:22,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:23,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 20:18:23,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-27 20:18:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:18:23,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:23,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898578130] [2024-11-27 20:18:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898578130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:18:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869950402] [2024-11-27 20:18:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:23,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:18:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:23,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:18:23,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:18:23,231 INFO L87 Difference]: Start difference. First operand 290 states and 423 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:18:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:24,442 INFO L93 Difference]: Finished difference Result 772 states and 1126 transitions. [2024-11-27 20:18:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:18:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-27 20:18:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:24,449 INFO L225 Difference]: With dead ends: 772 [2024-11-27 20:18:24,450 INFO L226 Difference]: Without dead ends: 485 [2024-11-27 20:18:24,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:18:24,452 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:24,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1150 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 20:18:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-27 20:18:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2024-11-27 20:18:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 407 states have (on average 1.3857493857493857) internal successors, (564), 412 states have internal predecessors, (564), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-27 20:18:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 700 transitions. [2024-11-27 20:18:24,531 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 700 transitions. Word has length 150 [2024-11-27 20:18:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:24,533 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 700 transitions. [2024-11-27 20:18:24,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:18:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 700 transitions. [2024-11-27 20:18:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:18:24,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:24,537 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:18:24,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:24,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:24,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:18:24,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:24,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1350989747, now seen corresponding path program 1 times [2024-11-27 20:18:24,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353348859] [2024-11-27 20:18:24,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:24,739 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-27 20:18:24,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:18:24,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:24,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:25,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 20:18:25,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:27,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:18:27,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 99 [2024-11-27 20:18:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-27 20:18:28,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:18:29,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:29,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353348859] [2024-11-27 20:18:29,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353348859] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 20:18:29,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:18:29,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-27 20:18:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531691773] [2024-11-27 20:18:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:29,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:18:29,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:29,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:18:29,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:18:29,141 INFO L87 Difference]: Start difference. First operand 481 states and 700 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:18:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:34,260 INFO L93 Difference]: Finished difference Result 1257 states and 1825 transitions. [2024-11-27 20:18:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:18:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-27 20:18:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:34,270 INFO L225 Difference]: With dead ends: 1257 [2024-11-27 20:18:34,271 INFO L226 Difference]: Without dead ends: 779 [2024-11-27 20:18:34,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:18:34,273 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 103 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:34,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 721 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-27 20:18:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-27 20:18:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 773. [2024-11-27 20:18:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 667 states have (on average 1.3898050974512743) internal successors, (927), 676 states have internal predecessors, (927), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-27 20:18:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1119 transitions. [2024-11-27 20:18:34,352 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1119 transitions. Word has length 150 [2024-11-27 20:18:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:34,353 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1119 transitions. [2024-11-27 20:18:34,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:18:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1119 transitions. [2024-11-27 20:18:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-27 20:18:34,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:34,358 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:18:34,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:18:34,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:34,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:18:34,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 71126069, now seen corresponding path program 1 times [2024-11-27 20:18:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193221784] [2024-11-27 20:18:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:34,565 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-27 20:18:34,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:18:34,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:34,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:35,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:18:35,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:35,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:18:35,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 203 treesize of output 59 [2024-11-27 20:18:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:18:35,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:35,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193221784] [2024-11-27 20:18:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193221784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:35,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:35,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:18:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245949323] [2024-11-27 20:18:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:35,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:18:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:35,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:18:35,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:18:35,707 INFO L87 Difference]: Start difference. First operand 773 states and 1119 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:18:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:40,244 INFO L93 Difference]: Finished difference Result 2002 states and 2883 transitions. [2024-11-27 20:18:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:18:40,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-27 20:18:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:40,255 INFO L225 Difference]: With dead ends: 2002 [2024-11-27 20:18:40,255 INFO L226 Difference]: Without dead ends: 1232 [2024-11-27 20:18:40,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:18:40,259 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:40,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 693 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-27 20:18:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-11-27 20:18:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1222. [2024-11-27 20:18:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1068 states have (on average 1.3838951310861423) internal successors, (1478), 1085 states have internal predecessors, (1478), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 119 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-27 20:18:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1750 transitions. [2024-11-27 20:18:40,427 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1750 transitions. Word has length 150 [2024-11-27 20:18:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:40,428 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1750 transitions. [2024-11-27 20:18:40,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:18:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1750 transitions. [2024-11-27 20:18:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:18:40,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:40,436 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:18:40,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:40,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:40,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:18:40,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1139777455, now seen corresponding path program 1 times [2024-11-27 20:18:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:40,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497132592] [2024-11-27 20:18:40,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:40,638 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-27 20:18:40,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:18:40,640 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:18:40,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-27 20:20:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:43,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 20:20:43,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:14,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:21:14,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 515 treesize of output 155 [2024-11-27 20:21:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-27 20:21:21,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:21,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497132592] [2024-11-27 20:21:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497132592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:21,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 20:21:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829097639] [2024-11-27 20:21:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:21,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:21:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:21,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:21:21,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:21:21,230 INFO L87 Difference]: Start difference. First operand 1222 states and 1750 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:21:44,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:18,579 WARN L286 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:22:23,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:22:30,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:43,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:48,970 INFO L93 Difference]: Finished difference Result 2555 states and 3640 transitions. [2024-11-27 20:22:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:22:48,971 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2024-11-27 20:22:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:49,002 INFO L225 Difference]: With dead ends: 2555 [2024-11-27 20:22:49,003 INFO L226 Difference]: Without dead ends: 1336 [2024-11-27 20:22:49,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:22:49,006 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 489 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:49,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1505 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1227 Invalid, 1 Unknown, 0 Unchecked, 62.5s Time] [2024-11-27 20:22:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-27 20:22:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1155. [2024-11-27 20:22:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1008 states have (on average 1.373015873015873) internal successors, (1384), 1024 states have internal predecessors, (1384), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 110 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-27 20:22:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1636 transitions. [2024-11-27 20:22:49,098 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1636 transitions. Word has length 151 [2024-11-27 20:22:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:49,098 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1636 transitions. [2024-11-27 20:22:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:22:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1636 transitions. [2024-11-27 20:22:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:22:49,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:49,103 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:22:49,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-27 20:22:49,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:49,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:22:49,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1270047678, now seen corresponding path program 1 times [2024-11-27 20:22:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275393676] [2024-11-27 20:22:49,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:49,305 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-27 20:22:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:22:49,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:49,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:49,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-27 20:22:49,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:49,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:22:49,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-27 20:22:49,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:49,965 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 34 treesize of output 10 [2024-11-27 20:22:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:22:50,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:22:50,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:22:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275393676] [2024-11-27 20:22:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275393676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:22:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472269250] [2024-11-27 20:22:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:50,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:22:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:22:50,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:22:50,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:22:50,075 INFO L87 Difference]: Start difference. First operand 1155 states and 1636 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:22:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:51,958 INFO L93 Difference]: Finished difference Result 2603 states and 3689 transitions. [2024-11-27 20:22:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:22:51,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-27 20:22:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:51,968 INFO L225 Difference]: With dead ends: 2603 [2024-11-27 20:22:51,968 INFO L226 Difference]: Without dead ends: 1451 [2024-11-27 20:22:51,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:22:51,971 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 128 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:51,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1563 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-27 20:22:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-11-27 20:22:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1198. [2024-11-27 20:22:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1051 states have (on average 1.3710751665080876) internal successors, (1441), 1067 states have internal predecessors, (1441), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 110 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-27 20:22:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1693 transitions. [2024-11-27 20:22:52,052 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1693 transitions. Word has length 151 [2024-11-27 20:22:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1693 transitions. [2024-11-27 20:22:52,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:22:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1693 transitions. [2024-11-27 20:22:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:22:52,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:52,056 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:22:52,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-27 20:22:52,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:52,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:22:52,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 877020668, now seen corresponding path program 1 times [2024-11-27 20:22:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679296063] [2024-11-27 20:22:52,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:52,258 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-27 20:22:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:22:52,260 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:52,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-27 20:22:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:22:52,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:52,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 20:22:52,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:52,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2024-11-27 20:22:52,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:52,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 16 [2024-11-27 20:22:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:22:53,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:22:53,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:22:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679296063] [2024-11-27 20:22:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679296063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:22:53,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:22:53,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:22:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362975402] [2024-11-27 20:22:53,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:22:53,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:22:53,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:22:53,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:22:53,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:22:53,025 INFO L87 Difference]: Start difference. First operand 1198 states and 1693 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:22:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:54,462 INFO L93 Difference]: Finished difference Result 2613 states and 3694 transitions. [2024-11-27 20:22:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:22:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-27 20:22:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:54,470 INFO L225 Difference]: With dead ends: 2613 [2024-11-27 20:22:54,470 INFO L226 Difference]: Without dead ends: 1418 [2024-11-27 20:22:54,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:22:54,473 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 117 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:54,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 919 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:22:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-11-27 20:22:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1414. [2024-11-27 20:22:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1234 states have (on average 1.3679092382495948) internal successors, (1688), 1254 states have internal predecessors, (1688), 155 states have call successors, (155), 24 states have call predecessors, (155), 24 states have return successors, (155), 135 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-27 20:22:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1998 transitions. [2024-11-27 20:22:54,586 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1998 transitions. Word has length 151 [2024-11-27 20:22:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:54,587 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 1998 transitions. [2024-11-27 20:22:54,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:22:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1998 transitions. [2024-11-27 20:22:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:22:54,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:54,591 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:22:54,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-27 20:22:54,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:54,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:22:54,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash -114388795, now seen corresponding path program 1 times [2024-11-27 20:22:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:54,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855266004] [2024-11-27 20:22:54,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:54,794 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-27 20:22:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:22:54,796 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:54,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:22:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:55,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-27 20:22:55,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-27 20:23:02,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:02,153 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855266004] [2024-11-27 20:23:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855266004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 20:23:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142186497] [2024-11-27 20:23:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:02,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 20:23:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:02,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 20:23:02,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:23:02,155 INFO L87 Difference]: Start difference. First operand 1414 states and 1998 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:23:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:14,824 INFO L93 Difference]: Finished difference Result 2945 states and 4157 transitions. [2024-11-27 20:23:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:23:14,825 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2024-11-27 20:23:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:14,832 INFO L225 Difference]: With dead ends: 2945 [2024-11-27 20:23:14,832 INFO L226 Difference]: Without dead ends: 1534 [2024-11-27 20:23:14,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:23:14,835 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 369 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:14,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1352 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-11-27 20:23:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-27 20:23:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1478. [2024-11-27 20:23:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1292 states have (on average 1.3653250773993808) internal successors, (1764), 1313 states have internal predecessors, (1764), 160 states have call successors, (160), 25 states have call predecessors, (160), 25 states have return successors, (160), 139 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-27 20:23:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2084 transitions. [2024-11-27 20:23:14,934 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2084 transitions. Word has length 151 [2024-11-27 20:23:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:14,934 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 2084 transitions. [2024-11-27 20:23:14,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-27 20:23:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2084 transitions. [2024-11-27 20:23:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:23:14,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:14,938 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:23:14,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:15,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:15,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:15,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -724097028, now seen corresponding path program 1 times [2024-11-27 20:23:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051420838] [2024-11-27 20:23:15,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:15,141 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-27 20:23:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:23:15,143 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:15,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-27 20:23:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:15,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:23:15,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 20:23:15,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:15,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-27 20:23:15,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 17 [2024-11-27 20:23:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:23:16,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:16,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:16,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051420838] [2024-11-27 20:23:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051420838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:16,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:16,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:23:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849602909] [2024-11-27 20:23:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:16,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:23:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:16,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:23:16,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:23:16,013 INFO L87 Difference]: Start difference. First operand 1478 states and 2084 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:23:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:17,725 INFO L93 Difference]: Finished difference Result 3241 states and 4577 transitions. [2024-11-27 20:23:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:23:17,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-27 20:23:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:17,734 INFO L225 Difference]: With dead ends: 3241 [2024-11-27 20:23:17,734 INFO L226 Difference]: Without dead ends: 1766 [2024-11-27 20:23:17,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:17,737 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 119 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:17,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 692 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-27 20:23:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-27 20:23:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1762. [2024-11-27 20:23:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1537 states have (on average 1.3669486011711125) internal successors, (2101), 1563 states have internal predecessors, (2101), 194 states have call successors, (194), 30 states have call predecessors, (194), 30 states have return successors, (194), 168 states have call predecessors, (194), 194 states have call successors, (194) [2024-11-27 20:23:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2489 transitions. [2024-11-27 20:23:17,867 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2489 transitions. Word has length 151 [2024-11-27 20:23:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:17,868 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2489 transitions. [2024-11-27 20:23:17,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:23:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2489 transitions. [2024-11-27 20:23:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:23:17,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:17,871 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:23:17,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-27 20:23:18,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:18,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1117124038, now seen corresponding path program 1 times [2024-11-27 20:23:18,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744953788] [2024-11-27 20:23:18,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:18,073 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-27 20:23:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:23:18,075 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:18,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:18,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 20:23:18,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:18,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 20:23:18,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:18,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-27 20:23:18,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:18,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 16 [2024-11-27 20:23:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-27 20:23:18,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:23:18,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744953788] [2024-11-27 20:23:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744953788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:23:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371112114] [2024-11-27 20:23:18,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:18,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:23:18,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:18,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:23:18,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:23:18,904 INFO L87 Difference]: Start difference. First operand 1762 states and 2489 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:23:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:21,301 INFO L93 Difference]: Finished difference Result 3598 states and 5083 transitions. [2024-11-27 20:23:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:23:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-27 20:23:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:21,311 INFO L225 Difference]: With dead ends: 3598 [2024-11-27 20:23:21,311 INFO L226 Difference]: Without dead ends: 1839 [2024-11-27 20:23:21,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:23:21,314 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 119 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:21,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1615 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-27 20:23:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-27 20:23:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1835. [2024-11-27 20:23:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1594 states have (on average 1.3638644918444165) internal successors, (2174), 1622 states have internal predecessors, (2174), 208 states have call successors, (208), 32 states have call predecessors, (208), 32 states have return successors, (208), 180 states have call predecessors, (208), 208 states have call successors, (208) [2024-11-27 20:23:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2590 transitions. [2024-11-27 20:23:21,441 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2590 transitions. Word has length 151 [2024-11-27 20:23:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:21,442 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2590 transitions. [2024-11-27 20:23:21,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-27 20:23:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2590 transitions. [2024-11-27 20:23:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-27 20:23:21,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:21,447 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:23:21,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:21,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:21,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1945524557, now seen corresponding path program 1 times [2024-11-27 20:23:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:21,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620722147] [2024-11-27 20:23:21,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:21,649 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-27 20:23:21,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:23:21,651 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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-27 20:23:21,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_787703a8-e32f-4f8e-8b69-c3d55e02d998/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -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